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 edition 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" (Lecture Notes in Computer Science)
August 17, 2004, Springer
Paperback
in English
- 1 edition
3540403442 9783540403449
|
aaaa
|
2
Primality Testing in Polynomial Time: From Randomized Algorithms to PRIMES Is in P
2004, Springer London, Limited
in English
3540259333 9783540259336
|
zzzz
|
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)
Lists
History
- Created April 30, 2008
- 19 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| December 10, 2024 | Edited by MARC Bot | import existing book |
| August 11, 2024 | Edited by MARC Bot | import existing book |
| February 10, 2023 | Edited by BWBImportBot | Modified local IDs, source records |
| December 5, 2022 | Edited by ImportBot | import existing book |
| April 30, 2008 | Created by an anonymous user | Imported from amazon.com record |