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.

Authors

Martin Dietzfelbinger

This author has not been identified. Look up 'Martin Dietzfelbinger' in Google