Computational Complexity
- 3SUM Problem
- Aaronson-Ambainis Conjecture
- Arithmetic Circuit
- Boolean Circuit
- Communication Complexity
- Computational Complexity
- Counting Complexity
- Counting Hierarchy
- Existential Theory of the Reals
- EXPTIME
- EXPTIME-Complete Problem
- Fully Polynomial-Time Randomized Approximation Scheme
- Iterated Matrix Multiplication
- Kalah
- Logarithmic Space
- Logarithmically Concave Sampling
- Minimum Equivalent Expression
- Moore Parity Conjecture
- No-Disentanglers Conjecture
- Noiseless Gaussian Regression
- Noncommutative Arithmetic Formula
- Nonnegative Matrix Factorization
- Polynomial Identity Testing
- Promise Problem
- Pseudorandom Unitary
- PSPACE
- QMA
- Query Complexity
- Random k-SAT
- Sign Rank
- Unitary Synthesis Problem
- Weak Membership Oracle