Exponential separation of information and communication for Boolean functions (Q5895073)
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: Exponential separation of information and communication for Boolean functions |
scientific article; zbMATH DE number 6912665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential separation of information and communication for Boolean functions |
scientific article; zbMATH DE number 6912665 |
Statements
Exponential Separation of Information and Communication for Boolean Functions (English)
0 references
2 August 2018
0 references
amortized communication complexity
0 references
communication complexity
0 references
communication compression
0 references
direct sum
0 references
information complexity
0 references
0.9900773167610168
0 references
0.870052695274353
0 references
0.8685010671615601
0 references
0.8684794306755066
0 references
0.8673911094665527
0 references
