Limitation on the Rate of Families of Locally Testable Codes (Q4933361): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-16367-8_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133169151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / 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: The PCP theorem by gap amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Locally Testable Codes and Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of Coding Theory in Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / 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 Cyclic Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Testable Codes Require Redundant Testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity testing in characteristic two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-degree testing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Reed–Muller Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Polynomials over General Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-transitivity is insufficient for local testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Codes with Applications to Testing / 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: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding / 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: Combinatorial Construction of Locally Testable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust locally testable codes and products of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-query PCP with subconstant error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition of Low-Error 2-Query PCPs Using Decodable PCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local list-decoding and testing of random linear codes from high error / 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: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Arguments and their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sound 3-Query PCPPs Are Long / 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: Bounds on locally testable codes with unique tests / 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: Q3293678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical theorem of set addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Szemerédi's theorem for arithmetic progressions of length four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Testable vs. Locally Decodable Codes / rank
 
Normal rank

Latest revision as of 08:22, 3 July 2024

scientific article; zbMATH DE number 5799050
Language Label Description Also known as
English
Limitation on the Rate of Families of Locally Testable Codes
scientific article; zbMATH DE number 5799050

    Statements

    Limitation on the Rate of Families of Locally Testable Codes (English)
    0 references
    0 references
    12 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    locally testable codes
    0 references
    error-correcting code
    0 references
    probabilistically checkable proofs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references