PRIMES is in P

Annals of Mathematics

Volumn 160, Issue 2, 2004, Pages 781-793

  Agrawal, Manindra ^a   Kayal, Neeraj ^a   Saxena, Nitin ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 15944367466     PISSN: 0003486X     EISSN: None     Source Type: Journal    
DOI: 10.4007/annals.2004.160.781     Document Type: Article

References (29)

1. [AH] L. M. ADLEMAN and M.-D. HUANG, Primality Testing and Abelian Varieties over Finite Fields, Lecture Notes in Math. 1512, Springer-Verlag, New York, 1992.
2. [APR] L. M. ADLEMAN, C. POMERANCE, and R. S. RUMELY, On distinguishing prime numbers from composite numbers, Ann. of Math. 117 (1983), 173-206.
3. [AB] M. AGRAWAL and S. BISWAS, Primality and identity testing via Chinese remaindering, Journal of the ACM 50 (2003), 429-443.
4. [AKS] M. AGRAWAL, N. KAYAL, and N. SAXENA, PRIMES is in P, preprint (http://www.cse.iitk.ac.in/news/primality.ps), August 2002.
5. [Apo] T. M. APOSTOL, Introduction to Analytic Number Theory, Springer-Verlag, New York, 1997.
6. [Atk] A. O. L. ATKIN, Lecture notes of a conference, Boulder (Colorado), Manuscript, August 1986.
7. [BH] R. C. BAKER and G. HARMAN, The Brun-Titchmarsh Theorem on average, in Analytic Number Theory, Volume I (Allerton Park, IL, 1995), Progr. Math. 138, 39-103, Birkhäuser Boston, Boston, MA, 1996.
8. [BP] R. BHATTACHARJEE and P. PANDEY, Primality testing, Technical report, IIT Kanpur, 2001; available at http://www.cse.iitk.ac.in/research/btp2001/ primality.html.
9. [Car] R. D. CARMICHAEL, Note on a number theory function, Bull. Amer. Math. Soc. 16 (1910), 232-238.
10. [Fou] E. FOUVRY, Théorème de Brun-Titchmarsh; application au théorème de Fermat, Invent. Math. 79 (1985), 383-407.
11. [GK] S. GOLDWASSER and J. KILIAN, Almost all primes can be quickly certified, in Proc. Annual ACM Symposium on the Theory of Computing, 316-329, 1986.
12. [GM] R. GUPTA and M. RAM MURTY, A remark on Artin's conjecture, Invent. Math. 78 (1984), 127-130.
13. [GMM] R. GUPTA, V. KUMAR MURTY, and M. RAM MURTY, The Euclidian algorithm for S-integers, Number Theory (Montreal, Que., 1985), CMS Conf. Proc. 7 (1987), 189-202.
14. [Gol] M. GOLDFELD, On the number of primes p for which p + a has a large prime factor, Mathematika 16 (1969), 23-27.
15. [HB] D. R. HEATH-BROWN, Artin's conjecture for primitive roots, Quart. J. Math. Oxford 37 (1986), 27-38.
16. [KS] N. KAYAL and N. SAXENA, Towards a deterministic polynomial-time test, Technical report, IIT Kanpur, 2002; available at http://www.cse.iitk.ac. in/ research/btp2002/primality.html.
17. [KSS] A. KALAI, A. SAHAI, and M. SUDAN, Notes on primality test and analysis of AKS, Private communication, August 2002.
18. [Lee] J. V. LEEUWEN (ed.), Handbook of Theoretical Computer Science, Volume A, MIT Press, Cambridge, MA, 1990.
19. [Len] H. W. LENSTRA, JR., Primality testing with cyclotomic rings, unpublished (see http://cr.yp.to/papers.html#aks for an exposition of Lenstra's argument), August 2002.
20. [LN] R. LIDL and H. NIEDERREITER, Introduction to Finite Fields and their Applications, Cambridge Univ. Press, Cambridge, 1986.
21. [LP1] H. W. LENSTRA, JR. and C. POMERANCE, Primality testing with gaussian periods, Private communication, March 2003.
22. [LP2] _, Remarks on Agrawal's conjecture, unpublished (http://www.aimath.org/ WWN/primesinp/articles/html/50a/), March 2003.
23. [Mac] M. MACAJ, Some remarks and questions about the AKS algorithm and related conjecture, unpublished (http://thales.doa.fmph.uniba.sk/macaj/ aksremarks.pdf), December 2002.
24. [Mil] G. L. MILLER, Riemann's hypothesis and tests for primality, J. Comput. Sys. Sci. 13 (1976), 300-317.
25. [Nai] M. NAIR, On Chebyshev-type inequalities for primes, Amer. Math. Monthly 89 (1982), 126-129.
26. [Pra] V. PRATT, Every prime has a succinct certificate, SIAM Journal on Computing 4 (1975), 214-220.
27. [Rab] M. O. RABIN, Probabilistic algorithm for testing primality, J. Number Theory 12 (1980), 128-138.
28. [SS] R. SOLOVAY and V. STRASSEN, A fast Monte-Carlo test for primality, SIAM Journal on Computing 6 (1977), 84-86.
29. [vzGG] J. VON ZUR GATHEN and J. GERHARD, Modern Computer Algebra, Cambridge Univ. Press, Cambridge, 1999.