A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852): Difference between revisions
From MaRDI portal
Latest revision as of 23:55, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A direct product theorem for two-party bounded-round public-coin communication complexity |
scientific article |
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