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.
@book{Dietzfelbinger04,
title = {Primality Testing in Polynomial Time, From Randomized Algorithms to PRIMES Is in P },
author = {Martin Dietzfelbinger},
year = {2004},
tags = {testing, random testing},
researchr = {https://researchr.org/publication/Dietzfelbinger04},
cites = {0},
citedby = {0},
volume = {3000},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40344-2},
}