Manindra Agrawal, Neeraj Kayal, Nitin Saxena  Home/Search
Context Related
| cse.iitk.ac.in/news/primality_v3.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.auckland.ac.nz/~msta039/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite. 1 (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.4%: PRIMES is in P - Agrawal, Kayal, Saxena (2002) (Correct)
Active bibliography (related documents): More All
0.5: Primality Testing in Polynomial Time - Smid (2003) (Correct)
0.4: Primality and Identity Testing via Chinese Remaindering - Agrawal, Biswas (2003) (Correct)
0.4: Fast Generation of Prime Numbers and Secure Public-Key.. - Maurer (1994) (Correct)
Similar documents based on text: More All
0.5: Towards a deterministic polynomial-time Primality Test - Kayal, Saxena (2002) (Correct)
0.3: On Sub-optimality and Scalability of Logic Synthesis Tools - Markov, Roy (2003) (Correct)
0.3: 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/article/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/article/agrawal02primes.html" }
Citations (may not include all citations):145 Introduction to finite fields and their applications (context) - Lidl, Niederreiter - 1986
104 Introduction to Analytic Number Theory (context) - Apostol - 1997
99 Handbook of Theoretical Computer Science (context) - Leeuwen - 1990
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
38 Almost all primes can be quickly certified (context) - Goldwasser, Kilian - 1986
34 Every prime has a succinct certificate (context) - Pratt - 1975
24 Modern Computer Algebra (context) - Gathen, Gerhard - 1999
10 A remark on Artin's conjecture (context) - Gupta, Murty - 1984
10 Primality testing and two dimensional Abelian varieties over.. (context) - Adleman, Huang - 1992
8 Artin's conjecture for primitive roots (context) - Heath-Brown - 1986
6 Lecture notes of a conference (context) - Atkin - 1986
5 Primality and identity testing via chinese remaindering - Agrawal, Biswas - 1999
5 The Brun-Titchmarsh Theorem on average (context) - Baker, Harman - 1996
4 Theoreme de Brun-Titchmarsh; application au theoreme de Ferm.. (context) - Fouvry - 1985
3 and Nitin Saxena (context) - Agrawal, Kayal - 2002
3 a has a large prime factor (context) - Goldfeld, number et al. - 1969
3 Primality testing (context) - Bhattacharjee, Pandey - 2001
3 Towards a deterministic polynomialtime test (context) - Kayal, Saxena - 2002
2 On Chebyshev-type inequalities for primes (context) - Nair - 1982
1 Notes on primality test and analysis of AKS (context) - Kalai, Sahai et al. - 2002
1 Note on a number theory function (context) - Carmichael - 1910
1 Primality testing with cyclotomic rings (context) - Lenstra - 2002
1 The Euclidian algorithm for S integers (context) - Gupta, Murty et al. - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.auckland.ac.nz/~msta039/):
From Heisenberg to Gödel via Chaitin - Calude, Stay (2004) (Correct)
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