Testing Odd-Cycle-Freeness in Boolean Functions (Q3168444): 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 / arXiv ID
 
Property / arXiv ID: 1105.1325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Fourier Dimensionality and Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance in Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Property Testing in the Dense Graphs Model / 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: Self-testing/correcting with applications to numerical problems / 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: Testing <i>k</i>-colorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Reed–Muller Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / 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: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in large graphs / 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: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerant property testing and distance approximation / 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: A removal lemma for systems of linear equations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Testing Bipartiteness in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Szemerédi-type regularity lemma in abelian groups, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems regarding testing graph properties / rank
 
Normal rank

Latest revision as of 19:33, 5 July 2024

scientific article
Language Label Description Also known as
English
Testing Odd-Cycle-Freeness in Boolean Functions
scientific article

    Statements

    Testing Odd-Cycle-Freeness in Boolean Functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 October 2012
    0 references

    Identifiers

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