Towards a reverse Newman's theorem in interactive information complexity (Q343858)
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 6657218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a reverse Newman's theorem in interactive information complexity |
scientific article; zbMATH DE number 6657218 |
Statements
Towards a reverse Newman's theorem in interactive information complexity (English)
0 references
29 November 2016
0 references
communication complexity
0 references
information complexity
0 references
information theory
0 references
compression
0 references
Slepian-Wolf
0 references
0 references
0.9032865166664124
0 references
0.7561652660369873
0 references
0.7519941329956055
0 references
0.7495267391204834
0 references
