Useful Links
Computer Science
Algorithms and Data Structures
Computational Complexity Theory
1. Introduction to Computational Complexity Theory
2. Mathematical Foundations
3. Models of Computation
4. Complexity Measurement
5. Time Complexity Classes
6. Reducibility and NP-Completeness
7. Space Complexity Theory
8. Hierarchy Theorems
9. Polynomial Hierarchy
10. Randomized Complexity
11. Interactive Proof Systems
12. Circuit Complexity
13. Quantum Complexity
14. Advanced Topics
Randomized Complexity
Probabilistic Computation Models
Probabilistic Turing Machines
Definition and Operation
Randomness as Resource
Random Bit Generation
Probability Distributions
Randomized Complexity Classes
Bounded-Error Probabilistic Polynomial Time BPP
Definition and Properties
Error Probability Bounds
Amplification Techniques
Randomized Polynomial Time RP
Definition and Characterization
One-Sided Error
Co-Randomized Polynomial Time co-RP
Definition and Properties
Zero-Error Probabilistic Polynomial Time ZPP
Definition and Properties
Expected Runtime
Class Relationships
RP ∩ co-RP = ZPP
BPP Containments
Randomized Algorithms
Primality Testing
Miller-Rabin Algorithm
Solovay-Strassen Algorithm
Polynomial Identity Testing
Randomized Data Structures
Derandomization
Pseudorandom Generators
Definition and Properties
Cryptographic Generators
Hardness versus Randomness
Nisan-Wigderson Generator
Hardness Assumptions
Derandomization Techniques
Method of Conditional Expectations
Exhaustive Search
Previous
9. Polynomial Hierarchy
Go to top
Next
11. Interactive Proof Systems