We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to approximately testing large objects based on a very small number of probes, each retrieving a single bit in the representation of the object. This yields super-fast approximate-testing of the corresponding property (i.e., be a codeword or a valid proof). We also review the related concept of local decodable codes. The survey consists of two independent (i.e., self-contained) parts that cover the same material at different levels of rigor and detail. Still, in spite of the repetitions, there may be a benefit in reading both parts. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Goldreich, O. (2011). Short locally testable codes and proofs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6650 LNCS, 333–372. https://doi.org/10.1007/978-3-642-22670-0_25
Mendeley helps you to discover research relevant for your work.