TY  - BOOK
AU  - Dietzfelbinger, Martin
TI  - LECTURE NOTES IN COMPUTER SCIENCE (V.3000): PRIMALITY TESTING IN POLYNOMIAL TIME : From randomized algorithms to "PRIMES is in P"
T2  - Lecture Notes in computer science
SN  - 3540403442
U1  - 001.64 
PY  - 2004///
CY  - Berlin
PB  - Springer-Verlag
KW  - Computer Science
UR  - http://link.springer.com/bookseries/558
ER  -