A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A direct product theorem for two-party bounded-round public-coin communication complexity |
scientific article; zbMATH DE number 6657217
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A direct product theorem for two-party bounded-round public-coin communication complexity |
scientific article; zbMATH DE number 6657217 |
Statements
A direct product theorem for two-party bounded-round public-coin communication complexity (English)
0 references
29 November 2016
0 references
communication complexity
0 references
information theory
0 references
strong direct product theorem
0 references
0 references
0.88723737
0 references
0.88284874
0 references
0.8804812
0 references
0.8787844
0 references
0.8777398
0 references
0.8765157
0 references
0.87640023
0 references
0.87487686
0 references
0.8722642
0 references
