Languages
Dietzfelbinger, Martin.
Overview
Works: | 1 works in 2 publications in 1 languages |
---|
Titles
Primality testing in polynomial timefrom randomized algorithms to "primes" is in P /
by:
Dietzfelbinger, Martin.; SpringerLink (Online service)
(Electronic resources)
Mathematical foundations of computer science 201439th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014 : proceedings.part I /
by:
(1998 :); Csuhaj-Varju, Erzsebet.; Dietzfelbinger, Martin.; Esik, Zoltan.; SpringerLink (Online service)
(Electronic resources)
Mathematical foundations of computer science 201439th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014 : proceedings.Part II /
by:
(1998 :); Csuhaj-Varju, Erzsebet.; Dietzfelbinger, Martin.; Esik, Zoltan.; SpringerLink (Online service)
(Electronic resources)
Subjects
Mathematical Logic and Formal Languages.
Computer algorithms
Polynomials.
Algorithm Analysis and Problem Complexity.
Data Structures.
Algorithms.
Computer programming
Numeric Computing.
Computer science
Numbers, Prime.
Computer Science.
Discrete Mathematics in Computer Science.
Math Applications in Computer Science.