First Page | Document Content | |
---|---|---|
Date: 2017-08-28 19:17:10Computational complexity theory Complexity classes Theory of computation NP Probabilistically checkable proof IP Proof of knowledge Reduction NC Craig interpolation EXPTIME Combinatory logic | Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa†Add to Reading ListSource URL: web.eecs.umich.eduDownload Document from Source WebsiteFile Size: 2,29 MBShare 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-coDocID: 1xTKi - View Document | |
PDF DocumentDocID: 1xSVG - View Document | |
PDF DocumentDocID: 1xSM6 - View Document | |
PDF DocumentDocID: 1xSJs - View Document |