An edition of Primality Testing in Polynomial Time
(2004)
Primality Testing in Polynomial Time
From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)
1 edition
by Martin Dietzfelbinger
- 1 Want to read
Share
×Close
This work doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Algorithms, Polynomials, Prime Numbers, Numbers, prime| Edition | Availability |
|---|---|
1
Primality Testing in Polynomial Time: From Randomized Algorithms to PRIMES Is in P
2004, Springer London, Limited
in English
3540259333 9783540259336
|
zzzz
|
2
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)
August 17, 2004, Springer
Paperback
in English
- 1 edition
3540403442 9783540403449
|
aaaa
|
Book Details
First Sentence
"A natural number n > 1 is called a prime number if it has no positive divisors other than 1 and n."
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
| October 4, 2021 | Edited by ImportBot | import existing book |
| July 6, 2019 | Edited by MARC Bot | import existing book |
| April 28, 2010 | Edited by Open Library Bot | Linked existing covers to the work. |
| December 10, 2009 | Created by WorkBot | add works page |