Simplified lower bounds on the multiparty communication complexity of disjointness (Q4601824)
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 6829272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplified lower bounds on the multiparty communication complexity of disjointness |
scientific article; zbMATH DE number 6829272 |
Statements
24 January 2018
0 references
communication complexity
0 references
set disjointness
0 references
number-on-forehead model
0 references
lower bounds
0 references
0.9158536791801452
0 references
0.9035528302192688
0 references
0.8650571703910828
0 references
0.8521851897239685
0 references
0.8496982455253601
0 references
