| 书目名称 | Computability and Complexity Theory |
| 编辑 | Steven Homer,Alan L. Selman |
| 视频video | |
| 概述 | New edition includes revised and updated material, plus five new chapters.Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory.Provides k |
| 丛书名称 | Texts in Computer Science |
| 图书封面 |  |
| 描述 | .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 loo |
| 出版日期 | Textbook 2011Latest edition |
| 关键词 | Computability; NP-Completeness; Nondeterminism; Nonuniform Complexity; Parallelism; computational comple |
| 版次 | 2 |
| doi | https://doi.org/10.1007/978-1-4614-0682-2 |
| isbn_softcover | 978-1-4899-8971-0 |
| isbn_ebook | 978-1-4614-0682-2Series ISSN 1868-0941 Series E-ISSN 1868-095X |
| issn_series | 1868-0941 |
| copyright | Springer Science+Business Media, LLC 2011 |
发表于 2025-3-21 19:54:29
