The linear-array conjecture in communication complexity is false (Q1125618)

From MaRDI portal
Revision as of 00:13, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q122887971, #quickstatements; #temporary_batch_1711055989931)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The linear-array conjecture in communication complexity is false
scientific article

    Statements

    title
    The linear-array conjecture in communication complexity is false (English)
    0 references
    DOI
    10.1007/s004930050054
    0 references
    author
    Eyal Kushilevitz
    0 references
    Rafail Ostrovsky
    0 references
    Nathan Linial
    0 references
    publication date
    8 December 1999
    0 references
    Mathematics Subject Classification ID
    68W10
    0 references
    94A05
    0 references
    68Q10
    0 references
    zbMATH DE Number
    1376205
    0 references
    zbMATH Keywords
    linear-array conjecture
    0 references
    OpenAlex ID
    W2610838164
    0 references
    Wikidata QID
    Q122887971
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1125618&oldid=33140571"
    Powered by MediaWiki