Towards lower bounds on locally testable codes via density arguments (Q693000): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Testing Reed–Muller Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Testable Cyclic Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitation on the Rate of Families of Locally Testable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Testable Codes Require Redundant Testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some 3CNF Properties Are Hard to Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short PCPs with Polylog Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the Rate of Locally Testable Affine-Invariant Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Rate Is Insufficient for Local Testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards lower bounds on locally testable codes via density arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PCP theorem by gap amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering in the Boolean Hypercube in a List Decoding Regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for linear locally decodable codes and private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally testable codes and PCPs of almost-linear length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-Query Codeword Testing with Near-Perfect Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: New direct-product testers and 2-query PCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Testable vs. Locally Decodable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric LDPC Codes and Local Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on 2-query locally testable codes with affine tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on locally testable codes with unique tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-rate codes with sublinear-time decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Construction of Locally Testable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field / rank
 
Normal rank

Latest revision as of 23:52, 5 July 2024

scientific article
Language Label Description Also known as
English
Towards lower bounds on locally testable codes via density arguments
scientific article

    Statements

    Towards lower bounds on locally testable codes via density arguments (English)
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    0 references
    locally testable codes
    0 references
    locally decodable codes
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references