Depth-independent lower bounds on the communication complexity of read-once Boolean formulas (Q3578302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5758123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Depth-independent lower bounds on the communication complexity of read-once Boolean formulas |
scientific article; zbMATH DE number 5758123 |
Statements
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas (English)
0 references
20 July 2010
0 references
0.9174575209617616
0 references
0.8391343951225281
0 references
0.8190338611602783
0 references
0.7965803146362305
0 references
