Testability and repair of hereditary hypergraph properties (Q3057063): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Tim D. Austin / rank
 
Normal rank
Property / author
 
Property / author: Terence C. Tao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3083751883 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0801.2179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations for partially exchangeable arrays of random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exchangeable random variables and the statistics of large graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Monotone 3‐Graph Property is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / 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: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetries on random arrays and set-indexed processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of local decoding procedures for error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Partitions of Hypergraphs: Regularity Lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer sets containing no arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma / rank
 
Normal rank

Latest revision as of 11:56, 3 July 2024

scientific article
Language Label Description Also known as
English
Testability and repair of hereditary hypergraph properties
scientific article

    Statements

    Testability and repair of hereditary hypergraph properties (English)
    0 references
    24 November 2010
    0 references
    local testability
    0 references
    hypergraph regularity Lemma
    0 references
    exchangeable processes
    0 references
    de Finetti's theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references