Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (Q3578302): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:42, 5 February 2024
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
20 July 2010
0 references
