Communication Complexity (Q5213788)

From MaRDI portal
Revision as of 22:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7162750
Language Label Description Also known as
English
Communication Complexity
scientific article; zbMATH DE number 7162750

    Statements

    title
    Communication Complexity (English)
    0 references
    author
    Anup Rao
    0 references
    Amir Yehudayoff
    0 references
    publication date
    4 February 2020
    0 references
    zbMATH Keywords
    algorithmics
    0 references
    computer algebra
    0 references
    computational geometry
    0 references
    communication complexity
    0 references
    signal processing
    0 references

    Identifiers

    DOI
    10.1017/9781108671644
    0 references
    Mathematics Subject Classification ID
    68-02
    0 references
    68M14
    0 references
    68Pxx
    0 references
    68Q06
    0 references
    68Q11
    0 references
    68U05
    0 references
    68W15
    0 references
    68W27
    0 references
    68W30
    0 references
    zbMATH DE Number
    7162750
    0 references
    OpenAlex ID
    W4211154544
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5213788&oldid=32246178"
    Powered by MediaWiki