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" Lecture Notes in Computer Science 3000 Springer 2004 3-540-40344-2 https://doi.org/10.1007/b12334