Book Chapter
Almost Transparent Short Proofs for NPℝ
Klaus Meer
Lecture Notes in Computer Science, 2011, Volume 6914, Fundamentals of Computation Theory, Pages 41-52
Book Chapter
Low-degree tests
Lecture Notes in Computer Science, 1995, Volume 1001, Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems, Pages 23-46
Book Chapter
Introduction
Lecture Notes in Computer Science, 1995, Volume 1001, Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems, Pages 1-14
Journal Article
Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size
Dana Moshkovitz and Ran Raz
Computational Complexity, 2010, Volume 19, Number 3, Pages 367-422
Book Chapter
Proof checking and non-approximability
Stefan Hougardy
Lecture Notes in Computer Science, 1998, Volume 1367, Lectures on Proof Verification and Approximation Algorithms, Pages 63-82
Journal Article
Improved Low-Degree Testing and its Applications
Sanjeev Arora* and Madhu Sudan†
Combinatorica, 2003, Volume 23, Number 3, Pages 365-426
Book Chapter
Computationally-sound checkers
Silvio Micali
Lecture Notes in Computer Science, 1998, Volume 1450, Mathematical Foundations of Computer Science 1998, Pages 94-116
Book Chapter
Keeping the SZK-verifier honest unconditionally
Giovanni Di Crescenzo, Tatsuaki Okamoto and Moti Yung
Lecture Notes in Computer Science, 1997, Volume 1294, Advances in Cryptology — CRYPTO '97, Pages 31-45
Book Chapter
Short Locally Testable Codes and Proofs: A Survey in Two Parts
Oded Goldreich
Lecture Notes in Computer Science, 2011, Volume 6390, Property Testing, Pages 65-104
Book Chapter
Short Locally Testable Codes and Proofs
Oded Goldreich
Lecture Notes in Computer Science, 2011, Volume 6650, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, Pages 333-372