Category:計算複雑性理論

Quantum computer

Big O notation

Quantum supremacy

NP-hardness

Time complexity#Polynomial time

Computational complexity theory

Vertex cover

Complexity class

PSPACE

Cutting stock problem

Computational resource

Co-NP

Knapsack problem

Longest common subsequence

Turing degree

EXPSPACE

Vertex-cover problem

Natural proof

Matroid

Elementary recursive function

Approximation algorithm

EXPTIME

Polynomial hierarchy

Time complexity#Constant time

Exponential time hypothesis

Descriptive complexity theory

ESPACE

Compression theorem