|
|
|
|
| LEADER |
03441nmm a2200325 u 4500 |
| 001 |
EB000363698 |
| 003 |
EBX01000000000000000216750 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9781461406822
|
| 100 |
1 |
|
|a Homer, Steven
|
| 245 |
0 |
0 |
|a Computability and Complexity Theory
|h Elektronische Ressource
|c by Steven Homer, Alan L. Selman
|
| 250 |
|
|
|a 2nd ed. 2011
|
| 260 |
|
|
|a New York, NY
|b Springer US
|c 2011, 2011
|
| 300 |
|
|
|a XVI, 300 p
|b online resource
|
| 505 |
0 |
|
|a Preliminaries -- Introduction to Computability -- Undecidability -- Introduction to Complexity Theory -- Basic Results of Complexity Theory -- Nondeterminism and NP-Completeness -- Relative Computability -- Nonuniform Complexity -- Parallelism -- Probabilistic Complexity Classes -- Introduction to Counting Classes -- Interactive Proof Systems -- References -- Author Index -- Subject Index
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Selman, Alan L.
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Texts in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4614-0682-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4614-0682-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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 andpractical learning tool.
|
| 520 |
|
|
|a 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
|
| 520 |
|
|
|a 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.
|