Dietzfelbinger, Martin
Primality Testing in Polynomial Time: from randomized algorithms to Primes is in P - Berlin springer 2004 - 147 - Lecture notes in computer science ; 03000 .
3540403442
681 LNCS
Primality Testing in Polynomial Time: from randomized algorithms to Primes is in P - Berlin springer 2004 - 147 - Lecture notes in computer science ; 03000 .
3540403442
681 LNCS