Towards a reverse Newman's theorem in interactive information complexity (Q343858)

From MaRDI portal
Revision as of 04:31, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/algorithmica/BrodyBKLSV16, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers