| 000 | 01219cam a2200301 a 4500 | ||
|---|---|---|---|
| 001 | 673871 | ||
| 005 | 20170607124238.0 | ||
| 008 | 951211s1995 gw b 001 0 eng | ||
| 010 | _a 95050358 | ||
| 020 | _a9783540606154 | ||
| 040 |
_aDLC _cDLC _dDLC |
||
| 050 | 0 | 0 |
_aQA267 _b.S83 1995 |
| 082 | 0 | 0 |
_a005.14 _220 _bSUD-E |
| 100 | 1 | _aSudan, Madhu | |
| 245 | 1 | 0 |
_aEfficient checking of polynomials and proofs and the hardness of approximation problems _cMadhu Sudan. |
| 260 |
_aNew York : _bSpringer₋Verlag, _c©1995. |
||
| 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 | 4 | 2 |
_3Publisher description _uhttp://www.loc.gov/catdir/enhancements/fy0812/95050358-d.html |
| 906 |
_a7 _bcbc _corignew _d1 _eocip _f19 _gy-gencatlg |
||
| 942 |
_2ddc _cBK |
||
| 999 |
_c9514 _d9514 |
||