Dietzfelbinger, M. (2004). Primality testing in polynomial time: From randomized algorithms to "primes is in P". Springer.
Chicago Style (17th ed.) CitationDietzfelbinger, Martin. Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes Is in P". Berlin ; New York: Springer, 2004.
MLA (9th ed.) CitationDietzfelbinger, Martin. Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes Is in P". Springer, 2004.
Warning: These citations may not always be 100% accurate.