Computational Complexity Theory

  1. Mathematical Foundations
    1. Asymptotic Analysis
      1. Motivation for Asymptotic Notation
        1. Big O Notation
          1. Formal Definition
            1. Properties and Usage
              1. Common Functions and Growth Rates
              2. Big Omega Notation
                1. Formal Definition
                  1. Lower Bound Analysis
                  2. Big Theta Notation
                    1. Formal Definition
                      1. Tight Bounds
                      2. Little o Notation
                        1. Definition and Interpretation
                        2. Little Omega Notation
                          1. Definition and Interpretation
                          2. Comparing Growth Rates
                            1. Asymptotic Relationships
                            2. Basic Combinatorics and Probability
                              1. Counting Principles
                                1. Probability Distributions
                                  1. Expected Value and Variance
                                    1. Concentration Inequalities

                                  Previous

                                  1. Introduction to Computational Complexity Theory

                                  Go to top

                                  Next

                                  3. Models of Computation