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
Effective Python: 90 Specific Ways to Write Better Python, 2nd Edition
Updated and Expanded for Python 3 It’s easy to start developing programs with Python, which is …
book
C++ Crash Course
Upgrade your Code with C++ C++ is one of the most widely used languages for realworld …
book
Python Crash Course, 2nd Edition
This is the second edition of the best selling Python book in the world. Python Crash …
book
An Introduction to the Analysis of Algorithms, Second Edition
Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been …