Efficient checking of polynomials and proofs and the hardness of approximation problems
Material type: TextSeries: Lecture notes in computer science ; 1001Publication details: New York : Springer₋Verlag, ©1995.Description: xiv, 87 p. ; 24 cmISBN:- 9783540606154
- 005.14 20 SUD-E
- QA267 .S83 1995
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Books | IIITD Reference | Computer Science and Engineering | REF 005.14 SUD-E (Browse shelf(Opens below)) | Available | 003781 |
Total holds: 0
Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.
Includes bibliographical references (p. [73]-78) and index.
There are no comments on this title.