An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (Q5326603)

From MaRDI portal
scientific article; zbMATH DE number 6195467
Language Label Description Also known as
English
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,
scientific article; zbMATH DE number 6195467

    Statements

    An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (English)
    0 references
    0 references
    6 August 2013
    0 references
    0 references
    Boolean functions
    0 references
    randomized computation
    0 references
    decision tree complexity
    0 references
    query complexity
    0 references
    lower bounds
    0 references
    generalized costs
    0 references
    0 references