Category:Computational complexity theory

A

• Analysis of algorithms (3 C, 48 P)

C

• Circuit complexity (19 P)
• Complexity classes (1 C, 86 P)
• Computational resources (7 P)

D

• Descriptive complexity (11 P)

M

• Measures of complexity (1 C, 13 P)

N

• NP-complete problems (165 P)

P

• Parameterized complexity (1 C, 7 P)

Q

• Quantum complexity theory (18 P)
• Quantum computing (3 C, 121 P)

S

• Structural complexity theory (1 C, 13 P)

T

• Theorems in computational complexity theory (20 P)

• Computational complexity theory

*

• Complexity class
• Padding argument

A

• Aanderaa–Karp–Rosenberg conjecture
• Analysis of algorithms
• Approximation algorithm
• Asymptotic computational complexity
• Averaging argument

B

• Bernstein–Vazirani algorithm
• Best, worst and average case
• Boolean circuit

C

• Circuit complexity
• Circuits over sets of natural numbers
• Claw finding problem
• Combinatorial optimization
• Combinatorial search
• Communication complexity
• Complexity and Real Computation
• Complexity index
• The Complexity of Songs
• Computable topology
• Computational complexity
• Computational complexity of mathematical operations
• Computational complexity of matrix multiplication
• Computational topology
• Computationally bounded adversary
• Computing the permanent
• Constructible function

E

• Existential theory of the reals

F

• Folded Reed–Solomon code

G

• Games, Puzzles, and Computation
• Generic-case complexity
• Geometric complexity theory
• Glossary of quantum computing
• Graph isomorphism problem

H

• Half-exponential function
• Hamiltonian complexity
• Hardness of approximation
• Hartmanis–Stearns conjecture
• Hidden linear function problem

I

• Implicit computational complexity
• Interactive proof system
• Introduction to the Theory of Computation

K

• Klee–Minty cube
• Kolmogorov complexity

L

• L-notation
• Lempel–Ziv complexity
• List decoding
• Log-space computable function
• Log-space reduction
• Low-complexity art

M

• Many-one reduction
• Model of computation

N

• Natural proof
• Noisy intermediate-scale quantum computing
• Noisy intermediate-scale quantum era
• Non-constructive algorithm existence proofs
• Nondeterministic algorithm

P

• Parameterized complexity
• Pebble game
• Polynomial-time reduction
• Proof complexity
• Proof of knowledge
• Propositional proof system
• Pseudo-polynomial time

Q

• Quantum capacity
• Quantum complexity theory
• Quantum computing
• Quantum supremacy
• Quasi-polynomial growth
• Quasi-polynomial time

R

• Randomness extractor
• Randomness merger
• Reduction (complexity)

S

• Engineering:Silq
• Smoothed analysis
• Space complexity
• Straight-line program
• Strong NP-completeness
• Switching lemma

T

• Time complexity
• Transcomputational problem
• Transdichotomous model

U

• Software:Unique games conjecture
• Universal hashing