Category:計算複雑性理論

P versus NP problem

Big O notation

Quantum supremacy

Time complexity#Polynomial time

PSPACE

Co-NP

NP (complexity)

Vertex cover

Exponential time

EXPTIME

Computational resource

Computational complexity theory

Grzegorczyk hierarchy

Complexity class

Analysis of algorithms

EXPSPACE

Longest common subsequence

Natural proof

Time complexity#Linear time

Blum axioms

ESPACE

Compression theorem

Template:Complexity classes

E (complexity)

L (complexity)

LOGCFL

NC (complexity)

NL (complexity)