A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6657217 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
communication complexity | |||
| Property / zbMATH Keywords: communication complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
information theory | |||
| Property / zbMATH Keywords: information theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strong direct product theorem | |||
| Property / zbMATH Keywords: strong direct product theorem / rank | |||
Normal rank | |||
Revision as of 06:50, 28 June 2023
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
