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

Description

Based on the author's Ph. D. thesis, University of California, Berkeley, 1993. / Includes bibliographical references (p. [73]-78) and index. Also issued online.

Links & Downloads

1. http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=1001
2. http://www.loc.gov/catdir/enhancements/fy0812/95050358-d.html

Tags

Additional Fields

Identifer	oai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/33971740
Date	January 1900
Creators	Sudan, Madhu.
Publisher	Berlin ; New York : Springer₋Verlag,
Source Sets	OCLC
Language	English
Detected Language	English
Source	Restricted to SpringerLink subscribers