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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1583885
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Dima Yu. Grigoriev / rank
 
Normal rank

Revision as of 17:47, 28 February 2024

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