LEADER 03935nam  22007695  450 
001 996466039503316
005 20200703051625.0
010   $a3-540-48485-X
024 7 $a10.1007/3-540-60615-7
035   $a(CKB)1000000000016922
035   $a(SSID)ssj0000322819
035   $a(PQKBManifestationID)11247853
035   $a(PQKBTitleCode)TC0000322819
035   $a(PQKBWorkID)10288092
035   $a(PQKB)11587295
035   $a(DE-He213)978-3-540-48485-1
035   $a(PPN)155206877
035   $a(EXLCZ)991000000000016922
100   $a20121227d1995      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aEfficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems$b[electronic resource] /$fedited by Madhu Sudan
205   $a1st ed. 1995.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995.
215   $a1 online resource (XIV, 94 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1001
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-60615-7 
327   $aOn the resilience of polynomials -- Low-degree tests -- Transparent proofs and the class PCP -- Hardness of approximations -- Conclusions.
330   $aThis book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dissertation Competition. The author improved the presentation and included the progress achieved since the thesis was approved by the University of California at Berkeley. This work is a fascinating piece of theoretical computer science research building on deep results from different areas. It provides new theoretical insights and 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1001
606   $aAlgorithms
606   $aComputer logic
606   $aSoftware engineering
606   $aMathematical logic
606   $aCoding theory
606   $aInformation theory
606   $aNumerical analysis
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041
606   $aNumerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M14050
615  0$aAlgorithms.
615  0$aComputer logic.
615  0$aSoftware engineering.
615  0$aMathematical logic.
615  0$aCoding theory.
615  0$aInformation theory.
615  0$aNumerical analysis.
615 14$aAlgorithm Analysis and Problem Complexity.
615 24$aLogics and Meanings of Programs.
615 24$aSoftware Engineering.
615 24$aMathematical Logic and Formal Languages.
615 24$aCoding and Information Theory.
615 24$aNumerical Analysis.
676   $a005.1/4/015113
700   $aSudan$b Madhu$0753660
702   $aSudan$b Madhu$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466039503316
996   $aEfficient checking of polynomials and proofs and the hardness of approximation problems$91516200
997   $aUNISA