Probabilistically Checkable Proofs with Low Amortized Query Complexity

Madhu Sudan, Luca Trevisan. Probabilistically Checkable Proofs with Low Amortized Query Complexity. In FOCS. pages 18-27, 1998. [doi]

Abstract

Abstract is missing.