| 000 | 00580nam a2200181Ia 4500 | ||
|---|---|---|---|
| 999 |
_c6242 _d6242 |
||
| 008 | 161214s9999 xx 000 0 und d | ||
| 020 |
_a9783540606154 _cpbk |
||
| 082 |
_a004 _bSUD |
||
| 100 | _aSudan, Madhu | ||
| 245 | 0 | _aEfficient checking of polynomials and proofs and the hardness of approximation problems | |
| 260 |
_aBerlin: _bSpringer, _c1995 |
||
| 300 |
_axiv, 87 p.; _bill.: _c24 cm. |
||
| 365 |
_aINR _b2433.60 |
||
| 440 | _v1001 | ||
| 490 | _aLecture notes in computer science | ||
| 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. The 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 | _aAutomatic theorem proving | ||
| 650 | _aComputational complexity | ||
| 650 | _aNP-complete problems | ||
| 650 | _aCoding theory | ||
| 650 | _aPolynomial evaluation code | ||
| 942 |
_2ddc _cBK |
||