An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095)

From MaRDI portal
Revision as of 02:49, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An exponential lower bound on the size of algebraic decision trees for MAX
scientific article

    Statements

    An exponential lower bound on the size of algebraic decision trees for MAX (English)
    0 references
    0 references
    0 references
    0 references
    2 February 1999
    0 references
    computational complexity
    0 references
    algebraic decision trees
    0 references
    lower bounds
    0 references
    MAX problem
    0 references
    hypergraphs
    0 references
    minimal cutsets
    0 references

    Identifiers

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