Basket

  1. 1.
    0422288 - MÚ 2014 RIV US eng C - Conference Paper (international conference)
    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]
    R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : comlexity theory * communication complexity * interactive information complexity
    Subject RIV: BA - General Mathematics
    http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597746
    Permanent Link: http://hdl.handle.net/11104/0228474
    FileDownloadSizeCommentaryVersionAccess
    Koucky1.pdf1260.9 KBPublisher’s postprintrequire
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.