Efficient checking of polynomials and proofs and the hardness of approximation problems /

Bibliographic Details

Main Author:	Sudan, Madhu
Format:	Thesis Book
Language:	English
Published:	Berlin ; New York : Springer, [1995]
Series:	Lecture notes in computer science ; 1001.
Subjects:	NP-complete problems. Computational complexity. Automatic theorem proving.