A direct product theorem for the two-party bounded-round public-coin communication complexity (Q6988231)
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 8036006
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A direct product theorem for the two-party bounded-round public-coin communication complexity |
scientific article; zbMATH DE number 8036006 |
Statements
A direct product theorem for the two-party bounded-round public-coin communication complexity (English)
0 references
5 May 2025
0 references
