Tools

LEADER 02789cam a22005657a 4500

001 ssj0000609368;

003 WaSeSS;

005 20240412080346.0;

006 m d ;

007 cr n ;

008 111014s2011 nyua sb 001 0 eng d;

010 a| 2011941200;

015 a| GBB1997762| bnb;

016 7 a| 0158748622| Uk;

020 a| 9781461406815 (hbk.);

020 a| 1461406811 (hbk.);

020 a| 9781461406822 (e-ISBN);

035 a| (WaSeSS)ssj0000609368;

042 a| lccopycat;

049 a| EREEa| NEHH;

050 00 a| QA76b| .H6236 2011;

082 04 a| 0042| 23;

100 1 a| Homer, S.q| (Steven)=| ^A259634;

245 10 a| Computability and complexity theoryh| [electronic resource] /c| Steven Homer, Alan L. Selman.;

250 a| 2nd ed.;

260 a| New York ;a| London :b| Springer,;

300 a| xvi, 298 p. :b| ill. ;c| 24 cm.;

490 1 a| Texts in computer science;

504 a| Includes bibliographical references (p. 283-288) and index.;

505 0 a| 1. Preliminaries -- 2. Introduction to computability -- 3. Undecidability -- 4. Introduction to complexity theory -- 5. Basic results of complexity theory -- 6. Nondeterminism and NP-completeness -- 7. Relative computability -- 8. Nonuniform complexity -- 9. Parallelism -- 10. Probabilistic complexity classes -- 11. Introduction to counting classes -- 12. Interactive proof systems.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| Computer science.=| ^A267953;

650 0 a| Computable functions.=| ^A60697;

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

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

700 1 a| Selman, Alan L.=| ^A205017;

830 0 a| Texts in computer science.=| ^A530307;

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%2F978-1-4614-0682-2;

856 40 z| Full text available from Springer Nature - Springer Computer Science eBooks 2011 English Internationalu| https://go.openathens.net/redirector/ecu.edu?url=https%3A%2F%2Flink.springer.com%2F10.1007%2F978-1-4614-0682-2;

947 a| (OCoLC)ocn751753304;

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| 4023521;

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

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

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

Computability and complexity theory / Steven Homer, Alan L. Selman.

Author/creator	Homer, S.
Other author	Selman, Alan L.
Format	Electronic
Edition	2nd ed.
Publication Info	New York ; London : Springer,
Description	xvi, 298 p. : ill. ; 24 cm.
Supplemental Content	Full text available from Springer Books
Supplemental Content	Full text available from Springer Nature - Springer Computer Science eBooks 2011 English International
Subjects	Computer science. Computable functions. Computational complexity.

Series	Texts in computer science Texts in computer science. ^A530307
Contents	1. Preliminaries -- 2. Introduction to computability -- 3. Undecidability -- 4. Introduction to complexity theory -- 5. Basic results of complexity theory -- 6. Nondeterminism and NP-completeness -- 7. Relative computability -- 8. Nonuniform complexity -- 9. Parallelism -- 10. Probabilistic complexity classes -- 11. Introduction to counting classes -- 12. Interactive proof systems.
Bibliography note	Includes bibliographical references (p. 283-288) and index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2011941200
ISBN	9781461406815 (hbk.)
ISBN	1461406811 (hbk.)
ISBN	9781461406822 (e-ISBN)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

Computability and complexity theory / Steven Homer, Alan L. Selman.

Click here for more information about this title

Availability