0465743 - MÚ 2017 RIV US eng J - Journal Article
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman’s theorem in interactive information complexity.
Algorithmica. Roč. 76, č. 3 (2016), s. 749-781. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : communication complexity * information complexity * information theory
Subject RIV: BA - General Mathematics
Impact factor: 0.735, year: 2016
http://link.springer.com/article/10.1007%2Fs00453-015-0112-9
Permanent Link: http://hdl.handle.net/11104/0264183
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman’s theorem in interactive information complexity.
Algorithmica. Roč. 76, č. 3 (2016), s. 749-781. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : communication complexity * information complexity * information theory
Subject RIV: BA - General Mathematics
Impact factor: 0.735, year: 2016
http://link.springer.com/article/10.1007%2Fs00453-015-0112-9
Permanent Link: http://hdl.handle.net/11104/0264183