Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302)

From MaRDI portal
Revision as of 01:49, 19 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58040208, #quickstatements; #temporary_batch_1708296850199)
scientific article
Language Label Description Also known as
English
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas
scientific article

    Statements

    title
    Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (English)
    0 references
    author
    Rahul Jain
    0 references
    Hartmut Klauck
    0 references
    Shengyu Zhang
    0 references
    publication date
    20 July 2010
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68Q12
    0 references
    68W20
    0 references
    zbMATH DE Number
    5758123
    0 references
    Wikidata QID
    Q58040208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3578302&oldid=21592298"
    Powered by MediaWiki