Sciweavers

Share
11 search results - page 1 / 3
» Combinatorial PCPs with Short Proofs
Sort
View
CC
2016
Springer
4 years 8 months ago
Combinatorial PCPs with Short Proofs
The PCP theorem (Arora et. al., J. ACM 45(1,3)) asserts the existence of proofs that can be verified by reading a very small part of the proof. Since the discovery of the theorem...
Or Meir
SIAMCOMP
2008
130views more  SIAMCOMP 2008»
9 years 11 months ago
Short PCPs with Polylog Query Complexity
We give constructions of probabilistically checkable proofs (PCPs) of length n
Eli Ben-Sasson, Madhu Sudan
PROPERTYTESTING
2010
9 years 9 months ago
Short Locally Testable Codes and Proofs: A Survey in Two Parts
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 a...
Oded Goldreich
FOCS
2004
IEEE
10 years 3 months ago
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduc...
Irit Dinur, Omer Reingold
ECCC
2007
86views more  ECCC 2007»
9 years 11 months ago
Interactive PCP
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
Yael Tauman Kalai, Ran Raz
books