Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (Q2947571)

From MaRDI portal
Revision as of 21:16, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity
scientific article

    Statements

    Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    influence of a Boolean function
    0 references
    sublinear query approximation algorithms
    0 references
    symmetric chains
    0 references