Interactive proofs with competing teams of no-signaling provers

First Page		Document Content
Date: 2013-07-24 10:11:20 NEXPTIME IP NP Soundness KeY Logic programming Interactive proof system Zero-knowledge proof Theoretical computer science Applied mathematics Complexity classes		Interactive proofs with competing teams of no-signaling provers Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 298,91 KB Share Document on Facebook

	Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai† DocID: 1xUdf - View Document
	Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve NP-co DocID: 1xTKi - View Document
	PDF Document DocID: 1xSVG - View Document
	PDF Document DocID: 1xSM6 - View Document
	PDF Document DocID: 1xSJs - View Document