Primality testing in polynomial time from randomized algorithms to "Primes is in P"
| Main Author: | Dietzfelbinger, Martin |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin
Springer
2004
|
| Series: | Lecture notes in computer science
3000 |
| Subjects: |
Similar Items
-
Primality Testing in Polynomial Time From Randomized Algorithms to "PRIMES Is in P" /
by: Dietzfelbinger, Martin
Published: (2004) -
Computer algebra Systems and algorithms for algebraic computation
by: Davenport, J. H.
Published: (1988) -
Discrete mathematical structures for computer science
by: Kolman, Bernard 1932-
Published: (1987) -
Discrete mathematics /
by: Ross, Kenneth A.
Published: (1985) -
Studies in computer science
Published: (1982)