Nikolai K. Vereshchagin
AuthID: R-00H-CSA
1
TÃTULO: Towards a Reverse Newman's Theorem in Interactive Information Complexity Full Text
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLICAÇÃO: 2016, FONTE: Algorithmica, VOLUME: 76, NÚMERO: 3
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolai K Vereshchagin;
PUBLICAÇÃO: 2016, FONTE: Algorithmica, VOLUME: 76, NÚMERO: 3
2
TÃTULO: Towards a Reverse Newman's Theorem in Interactive Information Complexity
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLICAÇÃO: 2013, FONTE: 2013 IEEE Conference on Computational Complexity, CCC 2013 in Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013
AUTORES: Joshua Brody; Harry Buhrman; Koucky, Michal ; Bruno Loff ; Florian Speelman; Nikolay K Vereshchagin;
PUBLICAÇÃO: 2013, FONTE: 2013 IEEE Conference on Computational Complexity, CCC 2013 in Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013
