Probabilistically Checkable Proofs with Low Amortized Query Complexity.

Madhu Sudan, Luca Trevisan

Browse the full FOCS paper archive.