Similar to NP困難
Arthur–Merlinプロトコル
Arthur–Merlin protocol
Co-NP
Co-NP
E (計算複雑性理論)
E (complexity)
ESPACE
ESPACE
EXPSPACE
EXPSPACE
EXPTIME
EXPTIMEL (計算複雑性理論)
L (complexity)LOGCFL
LOGCFLNC (計算複雑性理論)
NC (complexity)NEXPTIME
NEXPTIMENL (計算複雑性理論)
NL (complexity)
NP
NP (complexity)
NTIME
NTIMEP (計算複雑性理論)
P (complexity)PCP (計算複雑性理論)
Probabilistically checkable proofPH (計算複雑性理論)
PH (complexity)P≠NP予想
P versus NP problemPR (計算複雑性理論)
PR (complexity)R (計算複雑性理論)
R (complexity)RE (計算複雑性理論)
RE (complexity)SL (計算複雑性理論)
SL (complexity)
TQBF問題
True quantified Boolean formulaUP (計算複雑性理論)
UP (complexity)
圧縮定理
Compression theorem
アルゴリズム解析
Analysis of algorithms
PSPACE
PSPACE
0
0
1
1
