Category:Computational complexity theory

• Computational complexity theory

*

• Complexity class

A

• Advice (complexity)
• Analysis of algorithms
• Approximation algorithm

B

• Best, worst and average case

C

• Cobham's thesis
• Combinatorial optimization
• Combinatorial search
• Communication complexity
• Complement (complexity)
• Complete (complexity)
• The Complexity of Songs
• Compression theorem
• Computation tree
• Computational complexity
• Computational complexity of mathematical operations
• Computational resource
• Computational topology
• Constructible function

D

• Descriptive complexity theory

G

• Generalized game
• Graph isomorphism problem

I

• Interactive proof system

K

• Kolmogorov complexity

L

• L-notation
• Low (complexity)
• Low-complexity art

M

• Model of computation

N

• Natural proof
• Nondeterministic algorithm

P

• Parameterized complexity
• Proof complexity
• Proper complexity function
• Pseudo-polynomial time

Q

• Quantum computing

S

• Space complexity
• Strong NP-completeness

T

• Time complexity
• Tractable problem

U

• Unique games conjecture
• Universal hashing

Y

• Yao's principle