338 search results - page 3 / 68 » Locally checkable proofs |
ECCC
2007
13 years 7 months ago
2007
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
STACS
2001
Springer
14 years 9 days ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
ECCC
2010
13 years 8 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...