On the sensitivity complexity of bipartite graph properties (Q1935792)

From MaRDI portal
Revision as of 18:42, 21 March 2024 by Openalex240321050300 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the sensitivity complexity of bipartite graph properties
scientific article

    Statements

    On the sensitivity complexity of bipartite graph properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2013
    0 references
    0 references
    sensitivity complexity
    0 references
    bipartite graph
    0 references
    graph properties
    0 references
    Turan conjecture
    0 references
    decision tree
    0 references
    0 references