Primality Testing in Polynomial Time, From Randomized Algorithms to PRIMES Is in P

Martin Dietzfelbinger. Primality Testing in Polynomial Time, From Randomized Algorithms to PRIMES Is in P . Volume 3000 of Lecture Notes in Computer Science, Springer, 2004.

Abstract

Abstract is missing.