Abstract
In this chapter, we finally get to the main theme of this book: the deterministic polynomial time primality test of M.Agrawal, N.Kayal, and N.Saxena. The basis of the presentation given here is the revised version [4] of their paper ”PRIMES is in P”, as well as the correctness proof in the formulation of D.G. Bernstein [10].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dietzfelbinger, M. (2004). 8. Deterministic Primality Testing in Polynomial Time. In: Primality Testing in Polynomial Time. Lecture Notes in Computer Science, vol 3000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25933-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-25933-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40344-9
Online ISBN: 978-3-540-25933-6
eBook Packages: Springer Book Archive