LEADER 01134nam--2200409---450-
001 990002892330203316
005 20070329163340.0
010   $a2-08-011056-X
035   $a000289233
035   $aUSA01000289233
035   $a(ALEPH)000289233USA01
035   $a000289233
100   $a20070329d2002----km-y0itay50------ba
101   $afre
102   $aFR
105   $a||||||||001yy
200 1 $aTondo$fPascal Quignard, Pierre Skira
210   $aParis$cFlammarion$dcopyr. 2002
215   $a60 p.$cill.$d28 cm
410  0$12001
454  1$12001
461  1$1001-------$12001
600 0 $aSkira,$bPierre$xCritica e interpretazione
606 0 $aArte contemporanea
676   $a709.04
700  1$aQUIGNARD,$bPascal$0443126
701  1$aSKIRA,$bPierre$0596477
801  0$aIT$bsalbc$gISBD
912   $a990002892330203316
951   $aXII.2.C. 1435$b190048 L.M.$cXII.2$d00125474
959   $aBK
969   $aUMA
979   $aVITALE$b90$c20070329$lUSA01$h1626
979   $aVITALE$b90$c20070329$lUSA01$h1632
979   $aVITALE$b90$c20070329$lUSA01$h1633
996   $aTondo$9989993
997   $aUNISA

LEADER 01164nam--2200373---450-
001 990002961620203316
005 20070807165815.0
010   $a3-540-40344-2
035   $a000296162
035   $aUSA01000296162
035   $a(ALEPH)000296162USA01
035   $a000296162
100   $a20070807d2004----km-y0itay0103----ba
101 0 $aeng
102   $aDE
105   $aa|||||||001yy
200 1 $aPrimality testing in polynomial time$efrom randomized algorithms to "PRIMES is in P"$fMartin Dietzfelbinger
210   $aBerlin [etc.]$cSpringer$dcopyr. 2004
215   $aX, 147 p.$cill.$d24 cm.
225 2 $aLecture notes in computer science$iTutoral$v3000
410  0$12001$aLecture notes in computer science$iTutoral$v3000
454  1$12001
461  1$1001-------$12001
606   $aAlgoritmi
676   $a005.1
700  1$aDIETZFELBINGER,$bMartin$0488533
801  0$aIT$bsalbc$gISBD
912   $a990002961620203316
951   $a001 LNCS 3000$b31083/CBS$c001 LNCS$d00215335
959   $aBK
969   $aSCI
979   $aSENATORE$b90$c20070807$lUSA01$h1658
996   $aPrimality testing in polynomial time$9287435
997   $aUNISA