Number of the records: 1
Towards a reverse Newman's theorem in interactive information complexity
- 1.
SYSNO 0422288 Title Towards a reverse Newman's theorem in interactive information complexity Author(s) Brody, J. (DK)
Buhrman, H. (NL)
Koucký, Michal (MU-W) RID, SAI, ORCID
Loff, B. (NL)
Speelman, F. (NL)
Vereshchagin, N.K. (RU)Source Title IEEE Conference on Computational Complexity 2013. S. 24-33. - Washington : IEEE, 2013 Conference IEEE Conference on Computational Complexity 2013, 05.06.2013-07.06.2013, Palo Alto Document Type Konferenční příspěvek (zahraniční konf.) Grant IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) GBP202/12/G061 GA ČR - Czech Science Foundation (CSF) Institutional support MU-W - RVO:67985840 Language eng Country US Keywords comlexity theory * communication complexity * interactive information complexity Cooperating institutions Aarhus University (Denmark)
Centrum Wiskunde & Informatica (Netherlands)
University of Amsterdam (Netherlands)URL http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597746 Permanent Link http://hdl.handle.net/11104/0228474 File Download Size Commentary Version Access Koucky1.pdf 1 260.9 KB Publisher’s postprint require
Number of the records: 1