Category:計算複雑性理論

P versus NP problem

Big O notation

NP-hardness

Vertex cover

Combinatorial optimization

Knapsack problem

Computational complexity theory

NP (complexity)

PSPACE

Quantum supremacy

Computational resource

Matroid

Longest common subsequence

Subset sum problem

Complexity

Complexity class

EXPTIME

Speedup theorem

Cutting stock problem

Polynomial hierarchy

Circuit complexity

Communication complexity

Elementary recursive function

Co-NP

NEXPTIME

Blum axioms

ESPACE

Compression theorem