A strong direct product theorem for corruption and the multiparty communication complexity of disjointness (Q2460032)
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 5211576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strong direct product theorem for corruption and the multiparty communication complexity of disjointness |
scientific article; zbMATH DE number 5211576 |
Statements
A strong direct product theorem for corruption and the multiparty communication complexity of disjointness (English)
0 references
14 November 2007
0 references
Communication complexity
0 references
direct product
0 references
direct sum
0 references
multiparty protocols
0 references
lower bounds
0 references
0.8981603
0 references
0.8958344
0 references
0.8918222
0 references
0.8880859
0 references
0.8880859
0 references
0.88723737
0 references
0.88214374
0 references
0.8804845
0 references
0.87176096
0 references
