1. Arora S (1994) Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, University of California, Berkeley
2. Babai L, Fortnow L, Levin LA, Szegedy M (1991) Checking computations in polylogarithmic time. In: Proceedings of the 23rd ACM symposium on theory of computing (STOC), pp 21–31. doi:10.1145/103418.103428
3. Bellare M, Coppersmith D, Håstad J, Kiwi MA, Sudan M (1996) Linearity testing in characteristic two. IEEE Trans Inf Theory 42(6):1781–1795. doi:10.1109/18.556674, (Preliminary version in 36th FOCS, 1995)
4. Ben-Sasson E (2010) Limitation on the rate of families of locally testable codes. In: [12], pp 13–31. doi:10.1007/978-3-642-16367-8_3
5. Ben-Sasson E, Sudan M (2008) Short PCPs with polylog query complexity. SIAM J Comput 38(2):551–607. doi:10.1137/050646445, (Preliminary version in 37th STOC, 2005)