| 000 | 00477nmm a2200145Ia 4500 | ||
|---|---|---|---|
| 008 | 230202s9999||||xx |||||||||||||||||und|| | ||
| 020 | _a9783540484851 | ||
| 100 | _aMadhu Sudan | ||
| 245 | 0 | _aEfficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems | |
| 250 | _a1995 | ||
| 260 |
_bSpringer Berlin Heidelberg _c1995 |
||
| 440 | _aLecture Notes in Computer Science | ||
| 650 | _aComputer Science | ||
| 856 | _uhttps://doi.org/10.1007/3-540-60615-7 | ||
| 999 |
_c27085 _d27085 |
||