The Multiparty Communication Complexity of Set Disjointness (Q2817790)

From MaRDI portal
Revision as of 12:59, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Multiparty Communication Complexity of Set Disjointness
scientific article

    Statements

    The Multiparty Communication Complexity of Set Disjointness (English)
    0 references
    0 references
    2 September 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    set disjointness
    0 references
    multiparty communication complexity
    0 references
    number-on-the-forehead model
    0 references
    communication lower bounds
    0 references
    circuit complexity
    0 references
    direct product theorems
    0 references
    XOR lemmas
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references