Amazon cover image
Image from Amazon.com

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

By: Material type: TextTextSeries: Lecture notes in computer science ; 1001Publication details: New York : Springer₋Verlag, ©1995.Description: xiv, 87 p. ; 24 cmISBN:
  • 9783540606154
Subject(s): DDC classification:
  • 005.14 20 SUD-E
LOC classification:
  • QA267 .S83 1995
Online resources: 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. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Books 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.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in

Powered by Koha