Part II: Nonuniform Complexity
by Ker-I Ko, Ding-Zhu Du
Theory of Computational Complexity, 2nd Edition
- 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 Polynomial-Time 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 NP-Hard Optimization Problems
- Chapter 8: Probabilistic Machines and Complexity Classes
- References
- End User License Agreement
Nonuniform Complexity
The Way that can be described
[with a finite number of words]
is not the eternal Way.
—Lao Tsu
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.