No CrossRef data available.
Article contents
Martin Dietzfelbinger. Primality testing in polynomial time—from randomized algorithms to “PRIMES is in P”. Lecture Notes in Computer Science, vol. 3000. Springer-Verlag, 2004, x + 147 pp.
Published online by Cambridge University Press: 15 January 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS1079898600002596/resource/name/firstPage-S1079898600002596a.jpg)
- Type
- Reviews
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2006