The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
PRIMES is in P
Open accessAbstract
We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Handbook of theoretical computer science
Leeuwen, J. V. (1990) · Medical Entomology and Zoology · Cited by 4,259
Introduction to Analytic Number Theory
Apostol, T. M. (1976) · Undergraduate Texts in Mathematics · doi:10.1007/978-3-662-28579-4 · Cited by 2,617
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5723 · Cited by 1,617
Introduction to Analytic Number Theory
Apostol, T. M. (1976) · Undergraduate texts in mathematics · doi:10.1007/978-1-4757-5579-4 · Cited by 1,583
The art of computer programming. Vol.2: Seminumerical algorithms
Knuth, D. E. (1981) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,232
Probabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
A First Course in Abstract Algebra.
Bogart, K. P., Gratzer, G., & Fraleigh, J. B. (1969) · The American Mathematical Monthly · doi:10.2307/2317912 · Cited by 711
Riemann's hypothesis and tests for primality
Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709
A Fast Monte-Carlo Test for Primality
Solovay, R., & Strassen, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206006 · Cited by 635
Every Prime Has a Succinct Certificate
Pratt, V. R. (1975) · SIAM Journal on Computing · doi:10.1137/0204018 · Cited by 309
On Distinguishing Prime Numbers from Composite Numbers
Adleman, L. M., Pomerance, C., & Rumely, R. S. (1983) · The Annals of Mathematics · doi:10.2307/2006975 · Cited by 305
Almost all primes can be quickly certified
Goldwasser, S., & Kilian, J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12162 · Cited by 198
Riemann's Hypothesis and tests for primality
Miller, G. L. (1975) · Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75 · doi:10.1145/800116.803773 · Cited by 186
Primality Testing and Abelian Varieties Over Finite Fields
Adleman, L. M., & Huang, M.-D. A. (1992) · Lecture notes in mathematics · doi:10.1007/bfb0090185 · Cited by 93
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Delegating computation: interactive proofs for muggles
Goldwasser, S., Kalai, Y. T., & Rothblum, G. N. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374396 · Cited by 484
Linear degree extractors and the inapproximability of max clique and chromatic number
Zuckerman, D. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132612 · Cited by 398
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Kabanets, V., & Impagliazzo, R. (2004) · computational complexity · doi:10.1007/s00037-004-0182-6 · Cited by 378
Arithmetic Circuits: A Survey of Recent Results and Open Questions
Shpilka, A., & Yehudayoff, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000039 · Cited by 363
Metadata
- Authors
- Agrawal, M., Kayal, N., & Saxena, N.
- Venue
- Annals of Mathematics
- Publisher
- Annals of Mathematics
- Published
- 2004-09-01
- Volume
- 160
- Issue
- 2
- Pages
- 781-793
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2159341052
- Cited by
- 931
- References
- 16
- FWCI
- 90.02
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.