This is a list of topics mentioned in Scott Aaronson proposed article improvement project, first posted on November 26th, 2008.
See here for a 30-day recent changes list for the articles listed below.
- Algorithmic game theory --> Algorithmic mechanism design
- Algorithmic mechanism design
- Algorithms for matrix multiplication --> Matrix multiplication#Algorithms for efficient matrix multiplication
- Arithmetic circuit complexity
- Average case complexity --> Average-case complexity
- Circuit complexity
- Combinatorial auction
- Conductance (probability)
- Derandomization --> Randomized algorithm
- Discrete harmonic analysis
- Glauber dynamics
- Hardness of approximation
- List-decoding
- Locally decodable code
- Locally testable code
- Max-flow min-cut --> Max-flow min-cut theorem
- Metric embedding
- Model of computation
- Online algorithms --> Online algorithm
- Polynomial identity testing
- Polynomial-time hierarchy
- Price of anarchy
- Primal-dual approximation algorithm (Primal-dual approximation?)
- Probabilistically checkable proofs --> PCP (complexity)
- Property testing
- Propositional proof complexity
- Quantum computation --> Quantum computer
- Sketching algorithms (Sketching algorithm?)
- Sparsest cut --> Cut (graph theory)
- Streaming algorithms (Streaming algorithm?)
- Unique games conjecture
- Worst case complexity
- Zero knowledge proof --> Zero-knowledge proof