Dietzfelbinger, M. (2004). Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P". Berlin, Heidelberg: Springer Berlin Heidelberg.
Chicago Style CitationDietzfelbinger, Martin. Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P". Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.
MLA CitationDietzfelbinger, Martin. Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P". Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.
Warning: These citations may not always be 100% accurate.