Two-party direct-sum questions through the lens of multiparty communication complexity (Q6487499)
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: Two-party direct-sum questions through the lens of multiparty communication complexity |
scientific article; zbMATH DE number 7650034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-party direct-sum questions through the lens of multiparty communication complexity |
scientific article; zbMATH DE number 7650034 |
Statements
Two-party direct-sum questions through the lens of multiparty communication complexity (English)
0 references
3 February 2023
0 references
communication complexity
0 references
direct sum
0 references
multiparty communication
0 references
0.77043616771698
0 references
0.7653443217277527
0 references
0.7620646953582764
0 references
0.7620502710342407
0 references
