Category:計算複雑性理論

P versus NP problem

Big O notation

NP-hardness

Vertex cover

Combinatorial optimization

Knapsack problem

NP (complexity)

Computational complexity theory

PSPACE

Quantum supremacy

Computational resource

Subset sum problem

Matroid

Longest common subsequence

Complexity class

EXPTIME

Complexity

Co-NP

Polynomial hierarchy

Speedup theorem

Circuit complexity

Exponential time

Communication complexity

Elementary recursive function

NEXPTIME

Blum axioms

ESPACE

Compression theorem