Hypergraph regularity and random sampling (Q6076218): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/rsa.21126 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Tight cycles and regular slices in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and approximation of MAX-CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Monotone Graph Property Is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testability and repair of hereditary hypergraph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random sampling in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with small subgraphs of large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniformity lemma for hypergraphs / 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: Three theorems regarding testing graph properties / 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: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs, quasi-randomness, and conditions for regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound for hypergraph regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic hypergraph regularity lemma / 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: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the hypergraph removal lemma / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/RSA.21126 / rank
 
Normal rank

Latest revision as of 18:13, 30 December 2024

scientific article; zbMATH DE number 7753405
Language Label Description Also known as
English
Hypergraph regularity and random sampling
scientific article; zbMATH DE number 7753405

    Statements

    Hypergraph regularity and random sampling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2023
    0 references
    random sampling
    0 references
    hypergraph regularity
    0 references
    property testing
    0 references
    0 references
    0 references

    Identifiers

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