Towards a Reverse Newman's Theorem in Interactive Information Complexity - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Joshua Brody' in GoogleThis author has not been identified. Look up 'Harry Buhrman' in GoogleThis author has not been identified. Look up 'Michal Koucký' in GoogleThis author has not been identified. Look up 'Bruno Loff' in GoogleThis author has not been identified. Look up 'Florian Speelman' in GoogleThis author has not been identified. Look up 'Nikolay K. Vereshchagin' in Google

runs on WebDSL