An improved lower bound on the sensitivity complexity of graph properties (Q551172): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2011.02.042 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.042 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039999266 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039999266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced subgraphs of the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of two problems on the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of Boolean functions as real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical complexity of graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691584 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2011.02.042 / rank
 
Normal rank

Latest revision as of 21:17, 9 December 2024

scientific article
Language Label Description Also known as
English
An improved lower bound on the sensitivity complexity of graph properties
scientific article

    Statements

    An improved lower bound on the sensitivity complexity of graph properties (English)
    0 references
    0 references
    14 July 2011
    0 references
    computational complexity
    0 references
    decision tree complexity
    0 references
    sensitivity complexity
    0 references
    graph property
    0 references

    Identifiers

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