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]

Authors

Madhu Sudan

This author has not been identified. Look up 'Madhu Sudan' in Google

Luca Trevisan

This author has not been identified. Look up 'Luca Trevisan' in Google