| Record ID | ia:efficientcheckin0000suda |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/efficientcheckin0000suda/efficientcheckin0000suda_marc.xml |
| Download MARC binary | https://www.archive.org/download/efficientcheckin0000suda/efficientcheckin0000suda_meta.mrc |
LEADER: 01028cam a2200265 a 4500
001 95050358
003 DLC
005 20080307082253.0
008 951211s1995 gw b 001 0 eng
010 $a 95050358
020 $a3540606157 (acid₋free paper)
040 $aDLC$cDLC$dDLC
050 00 $aQA267$b.S83 1995
082 00 $a005.1/4/015113$220
100 1 $aSudan, Madhu.
245 10 $aEfficient checking of polynomials and proofs and the hardness of approximation problems /$cMadhu Sudan.
260 $aBerlin ;$aNew York :$bSpringer₋Verlag,$cc1995.
300 $axiv, 87 p. ;$c24 cm.
440 0 $aLecture notes in computer science ;$v1001
502 $aBased on the author's Ph. D. thesis, University of California, Berkeley, 1993.
504 $aIncludes bibliographical references (p. [73]-78) and index.
650 0 $aNP-complete problems.
650 0 $aComputational complexity.
650 0 $aAutomatic theorem proving.
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0812/95050358-d.html