| Record ID | marc_columbia/Columbia-extract-20221130-004.mrc:294329748:2438 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-004.mrc:294329748:2438?format=raw |
LEADER: 02438fam a2200397 a 4500
001 1725474
005 20220608221613.0
008 951211s1995 nyu b 001 0 eng
010 $a 95050358
020 $a3540606157 (Berlin : softcover : alk. paper)
035 $a(OCoLC)503586510
035 $a(OCoLC)ocn503586510
035 $9ALD1149CU
035 $a(NNC)1725474
035 $a1725474
040 $aDLC$cDLC$dNNC$dOrLoB-B
050 00 $aQA267$b.S83 1996
082 00 $a005.1/4/015113$220
100 1 $aSudan, Madhu.$0http://id.loc.gov/authorities/names/n95119284
245 10 $aEfficient checking of polynomials and proofs and the hardness of approximation problems /$cMadhu Sudan.
260 $aNew York :$bSpringer,$c1995.
263 $a9601
300 $axiv, 87 pages ;$c24 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aLecture notes in computer science ;$v1001
502 $aBased on the author's Ph. D. thesis, University of California, Berkeley, 1992.
504 $aIncludes bibliographical references (p. [73]-78) and index.
505 00 $g1.$tIntroduction --$g2.$tOn the resilience of polynomials --$g3.$tLow-degree tests --$g4.$tTransparent proofs and the class PCP --$g5.$tHardness of approximations --$g6.$tConclusions --$tA. The Berlekamp Welch decoder --$tB. Composing proof systems --$tC. A characterization of NP via polynomial sequences.
520 $aThis work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields.
520 8 $aThe author provides important new foundational insights and essentially advances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory.
650 0 $aNP-complete problems.$0http://id.loc.gov/authorities/subjects/sh88005054
650 0 $aComputational complexity.$0http://id.loc.gov/authorities/subjects/sh85029473
650 0 $aAutomatic theorem proving.$0http://id.loc.gov/authorities/subjects/sh85010111
830 0 $aLecture notes in computer science ;$v1001.$0http://id.loc.gov/authorities/names/n42015162
852 00 $boff,eng$hQA267$i.S83 1995