Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568)

From MaRDI portal
Revision as of 01:12, 11 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
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
scientific article

    Statements

    title
    Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (English)
    0 references
    DOI
    10.1137/130928273
    0 references
    author
    Iordanis Kerenidis
    0 references
    Sophie Laplante
    0 references
    Virginie Lerays
    0 references
    Jérémie Roland
    0 references
    David Xiao
    0 references
    publication date
    4 November 2015
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68P30
    0 references
    68Q05
    0 references
    zbMATH DE Number
    6504679
    0 references
    zbMATH Keywords
    information complexity
    0 references
    communication complexity
    0 references
    zero-communication protocols
    0 references
    OpenAlex ID
    W2571088576
    0 references
    arXiv ID
    1204.1505
    0 references
    cites work
    Q3104217
    0 references
    Approximate Privacy
    0 references
    Q4449184
    0 references
    Q2913808
    0 references
    Q5414596
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449568&oldid=36210966"
    Powered by MediaWiki