Short locally testable codes and proofs

Authors:
Oded Goldreich
Affiliations:
Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Israel
Venue:
Studies in complexity and cryptography
Year:
2011

Citing 55
Cited 1

Checking computations in polylogarithmic time

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fully parallelized multi prover protocols for NEXP-time (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A note on efficient zero-knowledge proofs and arguments (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems

Journal of the ACM (JACM)
Efficient probabilistically checkable proofs and applications to approximations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
On the power of multi-prover interactive protocols

Theoretical Computer Science
Improved non-approximability results

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Nearly-linear size holographic proofs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Probabilistic checking of proofs and hardness of approximation problems

Probabilistic checking of proofs and hardness of approximation problems
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Efficient checking of polynomials and proofs and the hardness of approximation problems

Efficient checking of polynomials and proofs and the hardness of approximation problems
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Private information retrieval

Journal of the ACM (JACM)
Fast approximate PCPs

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the efficiency of local decoding procedures for error-correcting codes

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Some optimal inapproximability results

Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Computationally Sound Proofs

SIAM Journal on Computing
Locally Testable Codes and PCPs of Almost-Linear Length

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Many-Valued Logics and Holographic Proofs

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Upper Bound on Communication Complexity of Private Information Retrieval

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Small PCPs with Low Query Complexity

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Exponential lower bound for 2-query locally decodable codes via a quantum argument

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some 3CNF properties are hard to test

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Linearity testing in characteristic two

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Free bits, PCPs and non-approximability-towards tight results

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Some improvements to total degree tests

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Computationally efficient error-correcting codes and holographic proofs

Computationally efficient error-correcting codes and holographic proofs
Robust pcps of proximity, shorter pcps and applications to coding

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Short PCPs Verifiable in Polylogarithmic Time

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
The PCP theorem by gap amplification

Journal of the ACM (JACM)
Towards 3-query locally decodable codes of subexponential length

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem

SIAM Journal on Computing
Computational Complexity: A Conceptual Perspective

Computational Complexity: A Conceptual Perspective
Short PCPs with Polylog Query Complexity

SIAM Journal on Computing
Two Query PCP with Sub-Constant Error

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
3-query locally decodable codes of subexponential length

Proceedings of the forty-first annual ACM symposium on Theory of computing
On proximity oblivious testing

Proceedings of the forty-first annual ACM symposium on Theory of computing
Locally Testable Codes Require Redundant Testers

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Combinatorial Construction of Locally Testable Codes

SIAM Journal on Computing
Combinatorial PCPs with Efficient Verifiers

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Composition of Low-Error 2-Query PCPs Using Decodable PCPs

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)

SIAM Journal on Computing
Property testing of massively parametrized problems – a survey

Property testing

Locally testable codes and cayley graphs

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.