Towards a Reverse Newman's Theorem in Interactive Information Complexity

Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin. Towards a Reverse Newman's Theorem in Interactive Information Complexity. In Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013. pages 24-33, IEEE, 2013. [doi]

@inproceedings{BrodyBKLSV13,
  title = {Towards a Reverse Newman's Theorem in Interactive Information Complexity},
  author = {Joshua Brody and Harry Buhrman and Michal Koucký and Bruno Loff and Florian Speelman and Nikolay K. Vereshchagin},
  year = {2013},
  doi = {10.1109/CCC.2013.12},
  url = {http://dx.doi.org/10.1109/CCC.2013.12},
  researchr = {https://researchr.org/publication/BrodyBKLSV13},
  cites = {0},
  citedby = {0},
  pages = {24-33},
  booktitle = {Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013},
  publisher = {IEEE},
}