The multiparty communication complexity of set disjointness (Q5415499)
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 6294593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multiparty communication complexity of set disjointness |
scientific article; zbMATH DE number 6294593 |
Statements
The multiparty communication complexity of set disjointness (English)
0 references
13 May 2014
0 references
circuit complexity
0 references
direct product theorems
0 references
multiparty communication complexity
0 references
set disjointness problem
0 references
0.9794490337371826
0 references
0.9035528302192688
0 references
0.8605977892875671
0 references
0.8586629033088684
0 references
0.8520603775978088
0 references
