01257nam a2200325 i 4500991003189559707536040729s2004 de 001 0 eng d3540403442b13037638-39ule_instDip.to MatematicaengAMS 68WAMS 11A51AMS 11-04LC QA246.D54Dietzfelbinger, Martin488533Primality testing in polynomial time :from randomized algorithms to "primes is in p" /Martin DietzfelbingerBerlin :Springer,2004x, 147 p. ;23 cmLecture notes in computer science,0302-9743 ;3000.TutorialIncludes bibliographical references (p. [143]-144) and indexNumbers, PrimePolynomialsLecture notes in computer scienceTutorialLecture notes in computer science ;3000.b1303763821-09-0629-07-04991003189559707536LE013 94A DIE11 (2004)12013000147864le013pE27.00-l- 01110.i1383438106-09-04Primality testing in polynomial time287435UNISALENTOle01329-07-04ma -engde 00