Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan
(Lecture notes in computer science ; 1001)
Publisher | Berlin ; New York : Springer-Verlag |
---|---|
Year | c1995 |
Authors | *Sudan, Madhu |
Hide book details.
Location | Volume | Call No. | Barcode No. | Status | Comments | ISBN | Printed | Restriction | Reserve |
---|---|---|---|---|---|---|---|---|---|
Library Main Building 3rd fl. (Foreign Books) |
|
5080:1:1001 | 129514578% |
|
|
|
|
Hide details.
Material Type | Books |
---|---|
Size | xiv, 87 p. ; 24 cm |
Notes | Bibliography: p. [73]-78 Includes index |
Subjects | LCSH:NP-complete problems LCSH:Computational complexity LCSH:Automatic theorem proving |
Classification | NDC9:007.64 |
Language | English |
ID | 0000336153 |
ISBN | 3540606157 |
NCID | BA26600095 |
Similar Items
Usage statistics of this contents
Number of accesses to this page:4times