A large lower bound on the query complexity of a simple Boolean function (Q1041802)

From MaRDI portal
Revision as of 23:51, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A large lower bound on the query complexity of a simple Boolean function
scientific article

    Statements

    title
    A large lower bound on the query complexity of a simple Boolean function (English)
    0 references
    author
    Beate Bollig
    0 references
    publication date
    4 December 2009
    0 references
    Mathematics Subject Classification ID
    68W20
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5642376
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    branching programs
    0 references
    property testing
    0 references
    query complexity
    0 references
    randomized algorithms
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1041802&oldid=13048311"
    Powered by MediaWiki