Vytisknout
0422288 - MÚ 2014 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman's theorem in interactive information complexity.
IEEE Conference on Computational Complexity 2013. Washington: IEEE, 2013, s. 24-33. ISBN 978-1-4673-6466-9.
[IEEE Conference on Computational Complexity 2013. Palo Alto (US), 05.06.2013-07.06.2013]
Grant CEP: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institucionální podpora: RVO:67985840
Klíčová slova: comlexity theory * communication complexity * interactive information complexity
Kód oboru RIV: BA - Obecná matematika
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597746
Trvalý link: http://hdl.handle.net/11104/0228474
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman's theorem in interactive information complexity.
IEEE Conference on Computational Complexity 2013. Washington: IEEE, 2013, s. 24-33. ISBN 978-1-4673-6466-9.
[IEEE Conference on Computational Complexity 2013. Palo Alto (US), 05.06.2013-07.06.2013]
Grant CEP: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institucionální podpora: RVO:67985840
Klíčová slova: comlexity theory * communication complexity * interactive information complexity
Kód oboru RIV: BA - Obecná matematika
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597746
Trvalý link: http://hdl.handle.net/11104/0228474