How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗

First Page		Document Content
Date: 2015-05-01 02:12:54 Computational complexity theory Interactive proof system NEXPTIME Probabilistically checkable proof IP Cryptographic protocols Soundness NP Zero-knowledge proof Theoretical computer science Applied mathematics Complexity classes		How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗ Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 1.007,79 KB Share Document on Facebook

	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	SelectNet_Manual_v2_April_2012.pdf DocID: 1qMoc - View Document
	WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician? DocID: 1qjEP - View Document
	Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192. DocID: 1oP1q - View Document
	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 DocID: 1mroB - View Document