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

First Page		Document Content
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

	Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in Abstract DocID: 1ppLN - View Document
	Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. DocID: 1p3R3 - View Document
	1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum DocID: 1oKqW - View Document
	On the Composition of Public-Coin Zero-Knowledge Protocols Rafael Pass1 , Wei-Lung Dustin Tseng1 , and Douglas Wikström2 1 2 DocID: 1ov52 - View Document