On the concrete efficiency of probabilistically-checkable proofs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Eli Ben-Sasson' in GoogleThis author has not been identified. Look up 'Alessandro Chiesa' in GoogleThis author has not been identified. Look up 'Daniel Genkin' in GoogleThis author has not been identified. Look up 'Eran Tromer' in Google

runs on WebDSL