Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834)
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 7055360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching |
scientific article; zbMATH DE number 7055360 |
Statements
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (English)
0 references
15 May 2019
0 references
0.8680238
0 references
0 references
0.8398125
0 references
0.8383647
0 references
0.8366469
0 references
0.8351757
0 references
0.83354056
0 references
