Madhu Sudan Luca Trevisan Probabilistically Checkable Proofs with Low Amortized Query Complexity. 18-27 1998 FOCS http://dlib.computer.org/conferen/focs/9172/pdf/91720018.pdf db/conf/focs/focs98.html#SudanT98