Tools

LEADER 02167cam a2200457 a 4500

001 ssj0000322819;

003 WaSeSS;

005 20240712080447.0;

006 m d ;

007 cr n ;

008 951211s1995 gw sb 001 0 eng d;

010 a| 95050358;

020 a| 3540606157 (acid?free paper);

035 a| (WaSeSS)ssj0000322819;

040 a| DLCc| DLCd| DLCd| WaSeSS;

049 a| EREEa| NEHH;

050 00 a| QA267b| .S83 1995;

082 00 a| 005.1/4/0151132| 20;

100 1 a| Sudan, Madhu.=| ^A374279;

245 10 a| Efficient checking of polynomials and proofs and the hardness of approximation problemsh| [electronic resource] /c| Madhu Sudan.;

260 a| Berlin ;a| New York :b| Springer?Verlag,;

300 a| xiv, 87 p. ;c| 24 cm.;

440 0 a| Lecture notes in computer science ;v| 1001;

502 a| Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.;

504 a| Includes bibliographical references (p. [73]-78) and index.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| NP-complete problems.=| ^A374867;

650 0 a| Computational complexity.=| ^A74807;

650 0 a| Automatic theorem proving.=| ^A88007;

655 0 a| Electronic books.=| ^A491897;

856 40 z| Full text available from Springer Booksu| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2F10.1007%2F3-540-60615-7;

856 40 z| Full text available from SpringerLINK Lecture Notes in Computer Scienceu| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2F10.1007%2F3-540-60615-7;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 4058175;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4058175-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 1/1/2016x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4058175-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 1/1/2016x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4058175-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 1/1/2016x| EBOOKz| JERESOURCE;

Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan.

Author/creator	Sudan, Madhu
Format	Electronic
Publication Info	Berlin ; New York : Springer?Verlag,
Description	xiv, 87 p. ; 24 cm.
Supplemental Content	Full text available from Springer Books
Supplemental Content	Full text available from SpringerLINK Lecture Notes in Computer Science
Subjects	NP-complete problems. Computational complexity. Automatic theorem proving.

Series	Lecture notes in computer science ; 1001
Dissertation note	Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.
Bibliography note	Includes bibliographical references (p. [73]-78) and index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	95050358
ISBN	3540606157 (acid?free paper)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Online Content Full text available from Springer Books Full text available from Springer Books	✔ Available

Efficient checking of polynomials and proofs and the hardness of approximation problems / Madhu Sudan.

Click here for more information about this title

Availability