The following publications are possibly variants of this publication:
- Constant Rate PCPs for Circuit-SAT with Sublinear Query ComplexityEli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth. focs 2013: 320-329 [doi]
- Constant Rate PCPs for Circuit-SAT with Sublinear Query ComplexityEli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth. JACM, 63(4):32, 2016. [doi]
- Simple PCPs with poly-log rate and query complexityEli Ben-Sasson, Madhu Sudan. stoc 2005: 266-275 [doi]
- Simple PCPs with Poly-log Rate and Query ComplexityEli Ben-Sasson, Madhu Sudan. eccc, (060), 2004. [doi]
- Short PCPs with Polylog Query ComplexityEli Ben-Sasson, Madhu Sudan. SICOMP, 38(2):551-607, 2008. [doi]
- Interactive Oracle Proofs with Constant Rate and Query ComplexityEli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner. icalp 2017: [doi]