Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125.

First Page		Document Content
Date: 2008-05-08 17:50:59 Complexity classes Computational complexity theory Advice PP P/poly ArthurMerlin protocol Pseudorandom generator Randomized algorithm NP IP Extractor ACC0		Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. Add to Reading List Source URL: users.cms.caltech.edu Download Document from Source Website File Size: 251,91 KB Share Document on Facebook

	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 DocID: 1xTH1 - View Document
	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 DocID: 1xTyC - View Document
	Logical Methods in Computer Science Vol. 4 (4:, pp. 1–21 www.lmcs-online.org Submitted Published DocID: 1xTht - View Document