See this document in CiteSeerX!

PRIMES is in P (2002)  (Make Corrections)  (12 citations)
Manindra Agrawal, Neeraj Kayal, Nitin Saxena



  Home/Search   Context   Related

 
View or download:
cse.iitk.ac.in/users/man...primality.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cse.iitk.ac.in/users/mani...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a deterministic polynomial-time algorithm that determines whether an input number n is prime or composite. \The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. It has engaged the industry and wisdom of ancient and modern geometers to such an extent that it would be superuous to discuss the problem at length... Further, the dignity of the science... (Update)

Cited by:   More
Algorithm Engineering - Demetrescu, Finocchi, Italiano (2003)   (Correct)
Twin Primes Conjecture, 95 - Two-Sided Error Ufd   (Correct)
On the Security and Composability of the One Time Pad - Raub, Steinwandt, Müller-Quade (2004)   (Correct)

Similar documents (at the sentence level):
6.0%:   PRIMES is in P - Agrawal, Kayal, Saxena (2002)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Towards a deterministic polynomial-time Primality Test - Kayal, Saxena (2002)   (Correct)
0.2:   Zero-Knowledge Sets - Silvio Micali Michael (2003)   (Correct)
0.2:   Primality Testing, Integer Factorization, and Discrete Logarithms - Garefalakis (2000)   (Correct)

Similar documents based on text:   More   All
0.4:   Primality and Identity Testing via Chinese Remaindering - Agrawal, Biswas (2003)   (Correct)
0.4:   On Sub-optimality and Scalability of Logic Synthesis Tools - Markov, Roy (2003)   (Correct)
0.4:   The Computational Complexity Column - Fortnow   (Correct)

Related documents from co-citation:   More   All
4:   Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
3:   Fibonacci heaps and their uses in improved network optimization algorithms (context) - Fredman, Tarjan - 1987
3:   Designing Programs that Check their Work - Blum, Kannan - 1989

BibTeX entry:   (Update)

M. Agrawal, N. Kayal and N. Saxena, `PRIMES is in P', Preprint , 2002, 1-9. http://citeseer.ist.psu.edu/agrawal02primes.html   More

@misc{ agrawal02primes,
  author = "M. Agrawal and N. Kayal and N. Saxena",
  title = "PRIMES is in P",
  text = "M. Agrawal, N. Kayal and N. Saxena, `PRIMES is in P', Preprint , 2002,
    1-9.",
  year = "2002",
  url = "citeseer.ist.psu.edu/agrawal02primes.html" }
Citations (may not include all citations):
2003   The Art of Computer Programming (context) - Knuth - 1998
104   Introduction to Analytic Number Theory (context) - Apostol - 1997
92   Riemann's hypothesis and tests for primality (context) - Miller - 1976
78   Probabilistic algorithm for testing primality (context) - Rabin - 1980
66   A fast Monte-Carlo test for primality (context) - Solovay, Strassen - 1977
51   On distinguishing prime numbers from composite numbers (context) - Adleman, Pomerance et al. - 1983
25   A First Course in Abstract Algebra (context) - Fraleigh - 1990
19   Partitio Numerorum (context) - Hardy, Littlewood et al. - 1922
14   Introduction to nite elds and their applications (context) - Lidl, Niederreiter - 1986
10   Primality testing and two dimensional Abelian varieties over.. (context) - Adleman, Huang - 1992
6   Lecture notes of a conference (context) - Atkin - 1986
5   Almost all primes can be quickly certi ed (context) - Goldwasser, Kilian - 1986
5   The Brun-Titchmarsh Theorem on average (context) - Baker, Harman - 1996
5   Primality and identity testing via chinese remaindering - Agrawal, Biswas - 1999
4   Theoreme de Brun-Titchmarsh; application au theoreme de Ferm.. (context) - Fouvry - 1985
3   Towards a deterministic polynomial-time test (context) - Kayal, Saxena - 2002
3   Primality testing (context) - Bhattacharjee, Pandey - 2001



The graph only includes citing articles where the year of publication is known.


Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC