Category:計算複雑性理論

PSPACE

Descriptive complexity theory

Matroid

Cutting stock problem

Natural proof

Analysis of algorithms

Polynomial hierarchy

Elementary recursive function

Time complexity#Constant time

Communication complexity

Time complexity#Linear time

ESPACE

Compression theorem

Template:Complexity classes

E (complexity)

L (complexity)

LOGCFL

NC (complexity)

NL (complexity)

NTIME

P (complexity)

Probabilistically checkable proof

PH (complexity)

PR (complexity)

R (complexity)

RE (complexity)

SL (complexity)

UP (complexity)