Characterizations of locally testable linear- and affine-invariant families (Q764306): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ang Sheng Li / rank
Normal rank
 
Property / author
 
Property / author: Ang Sheng Li / rank
 
Normal rank
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.1016/j.tcs.2011.09.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998063107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the testable graph properties / 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: Probabilistic checking of proofs / 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: Linearity testing in characteristic two / 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: Some 3CNF Properties Are Hard to Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets / 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: Graph limits and parameter testing / 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: Locally testable codes and PCPs of almost-linear length / 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: Simple analysis of graph tests for linearity and PCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing low-degree polynomials over prime fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: New generalizations of the Reed-Muller codes--I: Primitive codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-constant error low degree test of almost-linear size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Robustness of Functional Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:27, 5 July 2024

scientific article
Language Label Description Also known as
English
Characterizations of locally testable linear- and affine-invariant families
scientific article

    Statements

    Characterizations of locally testable linear- and affine-invariant families (English)
    0 references
    0 references
    0 references
    13 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    error-correcting codes
    0 references
    locally testable codes
    0 references
    algebraic property tests
    0 references
    0 references