Back to Results
First PageMeta Content
Computational 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 List

Document Date: 2017-08-28 19:17:10

Open Document

File Size: 2,29 MB

Share Result on Facebook
UPDATE