Category:Computational complexity theory

A

• Analysis of algorithms (3 C, 43 P)

C

• Circuit complexity (12 P)
• Complexity classes (1 C, 41 P)
• Computational resources (2 P)

D

• Descriptive complexity (9 P)

M

• Measures of complexity (1 C, 9 P)

N

• NP-complete problems (69 P)

P

• Parameterized complexity (1 C, 4 P)

Q

• Quantum complexity theory (8 P)
• Quantum computing (3 C, 62 P)

S

• Structural complexity theory (1 C, 10 P)

T

• Theorems in computational complexity theory (11 P)

• Computational complexity theory

*

• Complexity class
• Padding argument

A

• Aanderaa–Karp–Rosenberg conjecture
• Analysis of algorithms
• Averaging argument

B

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

C

• Claw finding problem
• Combinatorial optimization
• Combinatorial search
• Computable topology
• Computational complexity
• Computational complexity of matrix multiplication
• Computational topology
• Computationally bounded adversary
• Computing the permanent
• Constructible function

F

• Folded Reed–Solomon code

G

• Games, Puzzles, and Computation
• Graph isomorphism problem

H

• Half-exponential function
• Hidden linear function problem

K

• Klee–Minty cube
• Kolmogorov complexity

L

• Lempel–Ziv complexity
• List decoding
• Log-space reduction
• Low-complexity art

M

• Many-one reduction

N

• Noisy intermediate-scale quantum era

P

• Polynomial-time reduction
• Proof of knowledge
• Pseudo-polynomial time

Q

• Quantum capacity
• Quantum computing

R

• Reduction (complexity)

S

• Engineering:Silq

T

• Transcomputational problem

U

• Software:Unique games conjecture