Ordered biclique partitions and communication complexity problems (Q2342387)

From MaRDI portal
Revision as of 01:07, 10 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
Ordered biclique partitions and communication complexity problems
scientific article

    Statements

    title
    Ordered biclique partitions and communication complexity problems (English)
    0 references
    author
    Manami Shigeta
    0 references
    Kazuyuki Amano
    0 references
    publication date
    28 April 2015
    0 references
    zbMATH DE Number
    6431564
    0 references
    zbMATH Keywords
    biclique partition
    0 references
    Boolean matrix
    0 references
    fooling set
    0 references
    rank
    0 references
    complete graphs
    0 references
    OpenAlex ID
    W2963309684
    0 references
    arXiv ID
    1311.6192
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2342387&oldid=35451995"
    Powered by MediaWiki