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

From MaRDI portal
Revision as of 04:13, 13 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2010
    0 references

    Identifiers