Results 1 
7 of
7
PRIMES is in P
 Ann. of Math
, 2002
"... We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1 ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
(Show Context)
We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1
RP3
"... Abstract — We implement the AgrawalKayalSaxena primality testing algorithm. We discuss optimizations to the implementation that resulted in improved performance over the initial implementation. We further discuss methods of obtaining faster runtimes for candidate primes of increasing size. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — We implement the AgrawalKayalSaxena primality testing algorithm. We discuss optimizations to the implementation that resulted in improved performance over the initial implementation. We further discuss methods of obtaining faster runtimes for candidate primes of increasing size.
Annals of Mathematics, 160 (2004), 781–793 PRIMES is in P
"... We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1. ..."
Abstract
 Add to MetaCart
(Show Context)
We present an unconditional deterministic polynomialtime algorithm that determines whether an input number is prime or composite. 1.