Category:計算複雑性理論

NEXPTIME
NEXPTIME
NTIME
NTIME
記述計算量
Descriptive complexity theory
ESPACE
ESPACE
圧縮定理
Compression theorem
Template:複雑性クラス
Template:Complexity classes
Arthur–Merlinプロトコル
Arthur–Merlin protocol
E (計算複雑性理論)
E (complexity)
L (計算複雑性理論)
L (complexity)
LOGCFL
LOGCFL
NC (計算複雑性理論)
NC (complexity)
NL (計算複雑性理論)
NL (complexity)
P (計算複雑性理論)
P (complexity)
PCP (計算複雑性理論)
Probabilistically checkable proof
PH (計算複雑性理論)
PH (complexity)
PR (計算複雑性理論)
PR (complexity)
R (計算複雑性理論)
R (complexity)
RE (計算複雑性理論)
RE (complexity)
SL (計算複雑性理論)
SL (complexity)
UP (計算複雑性理論)
UP (complexity)
還元 (計算複雑性理論)
Reduction (complexity)
グリードイド
Greedoid
線形時間
Time complexity#Linear time
対話型証明系
Interactive proof system
関数問題
Function problem
ブラムの公理
Blum axioms
TQBF問題
True quantified Boolean formula
回路計算量
Circuit complexity