<--- Back to Details
First PageDocument Content
Complexity classes / PSPACE-complete / IP / Generalized geography / PSPACE / PP / ArthurMerlin protocol / Computational complexity theory / NP / P / NEXPTIME / Reduction
Date: 2001-10-24 10:52:24
Complexity classes
PSPACE-complete
IP
Generalized geography
PSPACE
PP
ArthurMerlin protocol
Computational complexity theory
NP
P
NEXPTIME
Reduction

1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum

Add to Reading List

Source URL: cs-www.cs.yale.edu

Download Document from Source Website

File Size: 139,75 KB

Share Document on Facebook

Similar Documents

Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published

Logical Methods in Computer Science Vol. 10(1:, pp. 1–29 www.lmcs-online.org Submitted Published

DocID: 1xTZi - View Document

Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published

Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published

DocID: 1xTH1 - View Document

PP_icon-1_Einladung_A4_L3.indd

PP_icon-1_Einladung_A4_L3.indd

DocID: 1xTEi - View Document

ADVANCE INFORMATION  100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp

ADVANCE INFORMATION 100 POEMS ARE NOT ENOUGHNon-Fiction > Poetry Walking BookFairs-PAN ǀ Rs 299 ǀ 104 pp

DocID: 1xTyC - View Document

Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published

Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published

DocID: 1xTht - View Document