FEEDBACK Smiley face
Normal view MARC view ISBD view

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

By: Sudan, Madhu.
Material type: materialTypeLabelBookSeries: Lecture notes in computer science ; 1001. Publisher: New York : Springer₋Verlag, ©1995Description: xiv, 87 p. ; 24 cm.ISBN: 9783540606154.Subject(s): NP-complete problems | Computational complexity | Automatic theorem provingOnline resources: Publisher description Dissertation note: Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
Books Books IIITD
Reference
Computer Science and Engineering REF 005.14 SUD-E (Browse shelf) 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 for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in