A lower bound for randomized algebraic decision trees (Q1386178)

From MaRDI portal
Revision as of 16:47, 28 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1583885)
scientific article
Language Label Description Also known as
English
A lower bound for randomized algebraic decision trees
scientific article

    Statements

    A lower bound for randomized algebraic decision trees (English)
    0 references
    0 references
    0 references
    13 May 1998
    0 references
    randomized algebraic decision trees
    0 references
    knapsack problem
    0 references
    element distinctness problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references