Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs

Juraj Hromkovic, Martin Sauerhoff. Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. In Horst Reichel, Sophie Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings. Volume 1770 of Lecture Notes in Computer Science, pages 145-156, Springer, 2000. [doi]

Abstract

Abstract is missing.