A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-015-0100-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2277697754 / rank | |||
Normal rank | |||
Revision as of 20:18, 19 March 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
