Useful Links
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
  1. Computer Science
  2. 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
  1. Randomized Complexity
    1. Probabilistic Computation Models
      1. Probabilistic Turing Machines
        1. Definition and Operation
          1. Randomness as Resource
          2. Random Bit Generation
            1. Probability Distributions
            2. Randomized Complexity Classes
              1. Bounded-Error Probabilistic Polynomial Time BPP
                1. Definition and Properties
                  1. Error Probability Bounds
                    1. Amplification Techniques
                    2. Randomized Polynomial Time RP
                      1. Definition and Characterization
                        1. One-Sided Error
                        2. Co-Randomized Polynomial Time co-RP
                          1. Definition and Properties
                          2. Zero-Error Probabilistic Polynomial Time ZPP
                            1. Definition and Properties
                              1. Expected Runtime
                              2. Class Relationships
                                1. RP ∩ co-RP = ZPP
                                  1. BPP Containments
                                2. Randomized Algorithms
                                  1. Primality Testing
                                    1. Miller-Rabin Algorithm
                                      1. Solovay-Strassen Algorithm
                                      2. Polynomial Identity Testing
                                        1. Randomized Data Structures
                                        2. Derandomization
                                          1. Pseudorandom Generators
                                            1. Definition and Properties
                                              1. Cryptographic Generators
                                              2. Hardness versus Randomness
                                                1. Nisan-Wigderson Generator
                                                  1. Hardness Assumptions
                                                  2. Derandomization Techniques
                                                    1. Method of Conditional Expectations
                                                      1. Exhaustive Search

                                                  Previous

                                                  9. Polynomial Hierarchy

                                                  Go to top

                                                  Next

                                                  11. Interactive Proof Systems

                                                  © 2025 Useful Links. All rights reserved.

                                                  About•Bluesky•X.com