Sudan, Madhu <br/><br/>
Efficient checking of polynomials and proofs and the hardness of approximation problems 
Madhu Sudan 
 - Berlin  Springer-Verlag  1995 
 - xiv, 87 p. ; 24 cm 
<br/><br/> Based on the author's Ph. D. thesis, University of California, Berkeley, 1993. Includes bibliographical references (p. [73]-78) and index 
<br/><br/><label>ISBN: </label>9783540606154 
<br/><br/><label>ISSN: </label>95050358 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Automatic theorem proving<br/>Computational complexity<br/>NP-complete problems
<br/><br/><label>Dewey Class. No.: </label>512.9422 MAD