Computability and Complexity Theory [electronic resource] / by Steven Homer, Alan L. Selman.
- 2nd ed. 2011.
- New York, NY : Springer US : Imprint: Springer, 2011.
- Computer Science (Springer-11645)
Texts in computer science 1868-0941
Texts in Computer Science, 1868-0941
1 online resource (XVI, 300 pages)
- Local subjects:
- Theory of Computation.
Algorithm Analysis and Problem Complexity.
- System Details:
- text file PDF
- This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes: a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp─Lipton. a chapter studying properties of the fundamental probabilistic complexity classes a study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Toda a thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential and practical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified manner Provides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes.
Introduction to Computability
Introduction to Complexity Theory
Basic Results of Complexity Theory
Nondeterminism and NP-Completeness
Probabilistic Complexity Classes
Introduction to Counting Classes
Interactive Proof Systems
- Selman, Alan L. author., Author,
SpringerLink (Online service)
- Contained In:
- Springer eBooks
- Other format:
- Printed edition:
- Publisher Number:
- 10.1007/978-1-4614-0682-2 doi
- Access Restriction:
- Restricted for use by site license.
|Location||Notes||Your Loan Policy|
|Description||Status||Barcode||Your Loan Policy|