You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
PRIMES Is in P
Manindra Agrawal, Neeraj Kayal and Nitin Saxena
Annals of Mathematics
Second Series, Vol. 160, No. 2 (Sep., 2004), pp. 781-793
Published by: Annals of Mathematics
Stable URL: http://www.jstor.org/stable/3597229
Page Count: 13
You can always find the topics here!Topics: Prime numbers, Polynomials, Coefficients, Number theory, Degrees of polynomials, Mathematical rings, Natural logarithms, Algorithms
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.
Annals of Mathematics © 2004 Annals of Mathematics