On the concrete efficiency of probabilistically-checkable proofs

Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer. On the concrete efficiency of probabilistically-checkable proofs. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 585-594, ACM, 2013. [doi]

Abstract

Abstract is missing.