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]

@inproceedings{Ben-SassonCGT13-0,
  title = {On the concrete efficiency of probabilistically-checkable proofs},
  author = {Eli Ben-Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer},
  year = {2013},
  doi = {10.1145/2488608.2488681},
  url = {http://doi.acm.org/10.1145/2488608.2488681},
  researchr = {https://researchr.org/publication/Ben-SassonCGT13-0},
  cites = {0},
  citedby = {0},
  pages = {585-594},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
  editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
  publisher = {ACM},
  isbn = {978-1-4503-2029-0},
}