Robust pcps of proximity, shorter pcps and applications to coding

We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of circuits of size n):

• Type: Conference
• Year: 2004
• Where: STOC
• Authors: Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
• Keywords: Algorithms, Query Complexity, STOC 2004