Efficient checking of polynomials and proofs and the hardness of approximation problems
Sudan, Madhu
Efficient checking of polynomials and proofs and the hardness of approximation problems Madhu Sudan. - New York : Springer₋Verlag, ©1995. - xiv, 87 p. ; 24 cm. - Lecture notes in computer science ; 1001 .
Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.
Includes bibliographical references (p. [73]-78) and index.
9783540606154
95050358
NP-complete problems.
Computational complexity.
Automatic theorem proving.
QA267 / .S83 1995
005.14 / SUD-E
Efficient checking of polynomials and proofs and the hardness of approximation problems Madhu Sudan. - New York : Springer₋Verlag, ©1995. - xiv, 87 p. ; 24 cm. - Lecture notes in computer science ; 1001 .
Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.
Includes bibliographical references (p. [73]-78) and index.
9783540606154
95050358
NP-complete problems.
Computational complexity.
Automatic theorem proving.
QA267 / .S83 1995
005.14 / SUD-E