The exhaustive list of topics in Complexity Theory in which we provide Help with Homework Assignment and Help with Project is as follows:

- P-Completeness and the Circuit Value Problem (CVP)
- Alternation
- Circuit Complexity
- Relativization, The Baker-Gill-Solovay Theorem
- Randomized Computation
- BPP Error Amplification
- Verifying Polynomial Identities
- Valiant-Vazirani Theorem
- Universal Hash Functions
- Counting Classes
- Relations to Deterministic Classes
- Polynomial Hierarchy
- Polynomial Time Hierarchy Collapses
- Non-Uniform Complexity
- Toda's Theorem
- Quantum Computation
- Quantum Complexity
- Discrete Log Problem
- Calculable Quantum Fourier Transforms
- Oracle Quantum Turing Machines
- Reusing Random Bits for BPP Algorithms
- Interactive Proofs
- Zero-Knowledge Proofs
- Arthur-Merlin Games
- Interactive proofs of graph non-isomorphism
- Graph Isomorphism
- Probabilistically Checkable Proofs
- Implicit Circuit Sat and the Proof Outline
- Multilinear Polynomials
- Multilinearity Test
- Approximating Max-Clique
- Reducing Satisfiable Clauses in 3CNF
- Derandomizing Logspace Computations