Improved bounds for the randomized decision tree Complexity of recursive majority (Q2811168)

From MaRDI portal
Revision as of 09:37, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improved bounds for the randomized decision tree Complexity of recursive majority
scientific article

    Statements

    title
    Improved bounds for the randomized decision tree Complexity of recursive majority (English)
    0 references
    DOI
    10.1002/rsa.20598
    0 references
    author
    Frédéric Magniez
    0 references
    Ashwin Nayak
    0 references
    Miklos Santha
    0 references
    Jonah Sherman
    0 references
    Gábor Tardos
    0 references
    David Xiao
    0 references
    publication date
    10 June 2016
    0 references
    Mathematics Subject Classification ID
    05C80
    0 references
    05C78
    0 references
    68Q17
    0 references
    68R10
    0 references
    zbMATH DE Number
    6591528
    0 references
    zbMATH Keywords
    randomized decision tree
    0 references
    recursive majority
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2811168&oldid=27267190"
    Powered by MediaWiki