| Shelfclass_id | 4.B.3 |
| Sortkey | SUDAN, MADHU |
| Authors | Madhu Sudan |
| Title | Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems |
| Publisher | Springer-Verlag |
| Year | 1995 |
| Languages | eng |
| Isbn | 3540606157 |
| Series | Lecture Notes in Computer Science |
| Volume | 1001 |
| Issn | 0302-9743 |
| Description | xiv, 87 p. 24 cm. |
| Record date | 20110503 |
| Location | New York |
| Keywords | NP-complete problems, Computational complexity, Automatic theorem proving |
| Urlnote | Publisher description |
| Urls | http://www.loc.gov/catdir/enhancements/fy0812/95050358-d.html |