Concepedia

PRIMES is in P

Manindra Agrawal, Neeraj Kayal, Nitin Saxena

Annals of Mathematics · 2004 · 922 citations · 19 references

DOIFull text

Open access

Concepts

Abstract

We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.

References

19

Modern computer algebra

Choice Reviews Online · 2000 · 1.6K citations

, , +5

The art of computer programming. Vol.2: Seminumerical algorithms

Donald E. Knuth · Virtual Defense Library (Ministerio de Defensa) · 1981 · 1.2K citations

, , +11

Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes

G. H. Hardy, J. E. Littlewood · Acta Mathematica · 1923 · 881 citations · Full text

, , +6

Probabilistic algorithm for testing primality

Michael O. Rabin · Journal of Number Theory · 1980 · 867 citations

, , +10

A First Course in Abstract Algebra.

Kenneth P. Bogart, George Grätzer, John B. Fraleigh · American Mathematical Monthly · 1969 · 720 citations

, , +9