Book description
Praise for the First Edition
"...complete, uptodate coverage of computational complexity theory...the book promises to become the standard reference on computational complexity." Zentralblatt MATH
A thorough revision based on advances in the field of computational complexity and readers' feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered.
Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NPcompleteness theory, as well as:
A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science
Additional exercises at varying levels of difficulty to further test comprehension of the presented material
Endofchapter literature reviews that summarize each topic and offer additional sources for further study
Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize stateoftheart software and computational methods to conduct research.
Table of contents
 Cover
 Title Page
 Preface
 Notes on the Second Edition
 Part I: Uniform Complexity
 Part II: Nonuniform Complexity

Part III: Probabilistic Complexity

Chapter 8: Probabilistic Machines and Complexity Classes
 8.1 Randomized Algorithms
 8.2 Probabilistic Turing Machines
 8.3 Time Complexity of Probabilistic Turing Machines
 8.4 Probabilistic Machines with Bounded Errors
 8.5 BPP and P
 8.6 BPP and NP
 8.7 BPP and the PolynomialTime Hierarchy
 8.8 Relativized Probabilistic Complexity Classes
 Exercises
 Historical Notes
 Chapter 9: Complexity of Counting
 Chapter 10: Interactive Proof Systems
 Chapter 11: Probabilistically Checkable Proofs and NPHard Optimization Problems

Chapter 8: Probabilistic Machines and Complexity Classes
 References
 End User License Agreement
Product information
 Title: Theory of Computational Complexity, 2nd Edition
 Author(s):
 Release date: June 2014
 Publisher(s): Wiley
 ISBN: 9781118306086
You might also like
book
An Introduction to Formal Languages and Automata, 6th Edition
The Sixth Edition of An Introduction to Formal Languages and Automata provides an accessible, studentfriendly presentation …
book
Formal Languages and Automata Theory
Formal Languages and Automata Theory deals with the mathematical abstraction model of computation and its relation …
book
Handbook of Graph Theory, 2nd Edition
In the ten years since the publication of the bestselling first edition, more than 1,000 graph …
book
TCP/IP Illustrated, Volume 1: The Protocols
“For an engineer determined to refine and secure Internet operation or to explore alternative solutions to …