| Record ID | marc_loc_updates/v36.i10.records.utf8:21711811:1180 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_updates/v36.i10.records.utf8:21711811:1180?format=raw |
LEADER: 01180cam a22003134a 4500
001 2004107785
003 DLC
005 20080307142545.0
008 040524s2004 gw b 001 0 eng
010 $a 2004107785
020 $a3540403442 (acid-free paper)
040 $aDLC$cDLC$dDLC
042 $apcc
050 00 $aQA246$b.D54 2004
082 00 $a512.9/42$222
100 1 $aDietzfelbinger, Martin.
245 10 $aPrimality testing in polynomial time :$bfrom randomized algorithms to "primes" is in P /$cMartin Dietzfelbinger.
250 $a1st ed.
260 $aBerlin ;$aNew York :$bSpringer,$cc2004.
300 $ax, 147 p. ; 24 cm.
490 1 $aLNCS,$x0302-9743 ;$v3000.$aTutorial
504 $aIncludes bibliographical references (p. [143]-144) and index.
650 0 $aPolynomials.
650 0 $aNumbers, Prime.
650 0 $aAlgorithms.
830 0 $aLecture notes in computer science.$pTutorial.
830 0 $aLecture notes in computer science ;$v3000.
856 42 $3Contributor biographical information$uhttp://www.loc.gov/catdir/enhancements/fy0817/2004107785-b.html
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0817/2004107785-d.html