LEADER 01257nam a2200325 i 4500
001 991003189559707536
008 040729s2004    de            001 0 eng d
020   $a3540403442
035   $ab13037638-39ule_inst
040   $aDip.to Matematica$beng
084   $aAMS 68W
084   $aAMS 11A51
084   $aAMS 11-04
084   $aLC QA246.D54
100 1 $aDietzfelbinger, Martin$0488533
245 10$aPrimality testing in polynomial time :$bfrom randomized algorithms to "primes is in p" /$cMartin Dietzfelbinger
260   $aBerlin :$bSpringer,$c2004
300   $ax, 147 p. ;$c23 cm
490 10$aLecture notes in computer science,$x0302-9743 ;$v3000.$aTutorial
504   $aIncludes bibliographical references (p. [143]-144) and index
650  0$aNumbers, Prime
650  0$aPolynomials
830  0$aLecture notes in computer science$pTutorial
830  0$aLecture notes in computer science ;$v3000
907   $a.b13037638$b21-09-06$c29-07-04
912   $a991003189559707536
945   $aLE013 94A DIE11 (2004)$g1$i2013000147864$lle013$op$pE27.00$q-$rl$s-  $t0$u1$v1$w1$x0$y.i13834381$z06-09-04
996   $aPrimality testing in polynomial time$9287435
997   $aUNISALENTO
998   $ale013$b29-07-04$cm$da  $e-$feng$gde $h0$i0