1 option
Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan.
LIBRA QA267 .S83 1995
Available from offsite location
- Format:
- Book
- Thesis/Dissertation
- Author/Creator:
- Sudan, Madhu.
- Series:
- Lecture notes in computer science ; 1001.
- Lecture notes in computer science
- Language:
- English
- Subjects (All):
- NP-complete problems.
- Computational complexity.
- Automatic theorem proving.
- Physical Description:
- xiv, 87 pages ; 24 cm.
- Place of Publication:
- Berlin ; New York : Springer, [1995]
- Notes:
- Based on the author's Ph. D. thesis, University of California, Berkeley, 1992.
- Includes bibliographical references and index.
- ISBN:
- 3540606157
- OCLC:
- 33971740
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.