An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant

First Page		Document Content
Date: 2012-05-30 08:53:38 Computational complexity theory Cryptography Theory of computation Probabilistic complexity theory IP Zero-knowledge proof Soundness PP Entropy NP Randomized algorithm Interactive proof system		An Eﬃcient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant Add to Reading List Source URL: www.nada.kth.se Download Document from Source Website File Size: 287,66 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