Lower bounds for testing triangle-freeness in Boolean functions (Q2353187): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00037-014-0092-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3136761595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in large graphs / 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 / 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: Regular Languages are Testable with a Constant Number of Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in directed graphs / 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: Some 3CNF Properties Are Hard to Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Linear-Invariant Non-Linear Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and parameter testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the graph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication / 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: A Szemerédi-type regularity lemma in abelian groups, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex and Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Arithmetic Analogue of Fox's Triangle Removal Argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sunflowers and testing triangle-freeness of functions / 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: Testing Polynomials over General Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial proof of the removal lemma for groups / 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: Testing Basic Boolean Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the removal lemma / 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: Green's conjecture and testing linear-invariant properties / rank
 
Normal rank

Revision as of 11:18, 10 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for testing triangle-freeness in Boolean functions
scientific article

    Statements

    Lower bounds for testing triangle-freeness in Boolean functions (English)
    0 references
    0 references
    0 references
    8 July 2015
    0 references
    property testing
    0 references
    query lower bounds
    0 references
    Boolean function triangles
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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