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 |