Počet záznamů: 1
Towards a reverse Newman’s theorem in interactive information complexity
- 1.
SYSNO ASEP 0465743 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název Towards a reverse Newman’s theorem in interactive information complexity Tvůrce(i) Brody, J. (DK)
Buhrman, H. (NL)
Koucký, Michal (MU-W) RID, SAI, ORCID
Loff, B. (NL)
Speelman, F. (NL)
Vereshchagin, N.K. (RU)Zdroj.dok. Algorithmica. - : Springer - ISSN 0178-4617
Roč. 76, č. 3 (2016), s. 749-781Poč.str. 33 s. Jazyk dok. eng - angličtina Země vyd. US - Spojené státy americké Klíč. slova communication complexity ; information complexity ; information theory Vědní obor RIV BA - Obecná matematika CEP IAA100190902 GA AV ČR - Akademie věd Institucionální podpora MU-W - RVO:67985840 UT WOS 000384564100007 EID SCOPUS 84954306921 DOI 10.1007/s00453-015-0112-9 Anotace Newman’s theorem states that we can take any public-coin communication protocol and convert it into one that uses only private randomness with but a little increase in communication complexity. We consider a reversed scenario in the context of information complexity: can we take a protocol that uses private randomness and convert it into one that only uses public randomness while preserving the information revealed to each player? We prove that the answer is yes, at least for protocols that use a bounded number of rounds. As an application, we prove new direct-sum theorems through the compression of interactive communication in the bounded-round setting. To obtain this application, we prove a new one-shot variant of the Slepian–Wolf coding theorem, interesting in its own right. Furthermore, we show that if a Reverse Newman’s Theorem can be proven in full generality, then full compression of interactive communication and fully-general direct-sum theorems will result. Pracoviště Matematický ústav Kontakt Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Rok sběru 2017
Počet záznamů: 1