Category:Computational complexity theory

A

• ► Analysis of algorithms‎ (1 C, 33 P)

C

• ► Circuit complexity‎ (18 P)
• ► Complexity classes‎ (1 C, 86 P)
• ► Computational hardness assumptions‎ (17 P)
• ► Computational problems‎ (10 C, 24 P)

C cont.

• ► Computational resources‎ (9 P)

D

• ► Descriptive complexity‎ (9 P)

N

• ► NP-complete problems‎ (7 C, 75 P)

P

• ► Parameterized complexity‎ (1 C, 4 P)
• ► Probabilistic complexity theory‎ (1 C, 20 P)

Q

• ► Quantum complexity theory‎ (10 P)

S

• ► Strongly NP-complete problems‎ (1 C, 4 P)
• ► Structural complexity theory‎ (1 C, 16 P)

T

• ► Theorems in computational complexity theory‎ (20 P)

• Computational complexity theory

*

• Complexity class
• Configuration graph
• Padding argument

A

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

B

• Best, worst and average case
• Boolean circuit

C

• Certificate (complexity)
• Circuit complexity
• Circuits over sets of natural numbers
• Cobham's thesis
• Combinatorial optimization
• Combinatorial search
• Communication complexity
• Complement (complexity)
• Complete (complexity)
• Complexity index
• The Complexity of Songs
• Compression theorem
• Computable topology
• Computation tree
• Computational complexity of mathematical operations
• Computational resource
• Computational topology
• Computing the permanent
• Constructible function

C cont.

• Context of computational complexity

D

• Decision tree model
• Descriptive complexity theory
• Dynamic problem (algorithms)

E

• Effective complexity
• Electronic Colloquium on Computational Complexity
• Existential theory of the reals

F

• Folded Reed–Solomon code

G

• Gadget (computer science)
• Generalized game
• Generic-case complexity
• Geometric complexity theory

H

• Hardness of approximation
• HO (complexity)

I

• Information-based complexity
• Integer circuit
• Interactive proof system
• Interval-valued computation
• Introduction to the Theory of Computation

K

• Klee–Minty cube

L

• L-notation
• L-reduction
• Leaf language
• List decoding
• Log-space reduction
• Logical depth
• Low (complexity)

M

• Many-one reduction

N

• Natural proof
• Nondeterministic algorithm

P

• Parameterized complexity

P cont.

• Pebble game
• Polynomial-time reduction
• Proof (truth)
• Proof complexity
• Proper complexity function
• Propositional proof system
• Pseudo-polynomial time
• PTAS reduction

Q

• Quantum capacity
• Quantum complexity theory
• Quantum computer

R

• Randomness extractor
• Reduction (complexity)

S

• Semi-membership
• Smoothed analysis
• SO (complexity)
• Sparse language
• Strongly NP-complete
• Switching lemma
• Symmetric Turing machine

T

• Time complexity
• Transcomputational problem
• Transdichotomous model
• Truth-table reduction
• Turing reduction

U

• Unary language
• Unique games conjecture
• Universal hashing

W

• Weakly NP-complete

Y

• Yao's principle