Towards a reverse Newman's theorem in interactive information complexity (Q343858): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-015-0112-9 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/algorithmica/BrodyBKLSV16 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-015-0112-9 / rank | |||
Normal rank | |||
Latest revision as of 14:53, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards a reverse Newman's theorem in interactive information complexity |
scientific article |
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
