Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity

Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon. Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. In Ramesh Hariharan, Madhavan Mukund, V. Vinay, editors, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings. Volume 2245 of Lecture Notes in Computer Science, pages 171-182, Springer, 2001. [doi]

Abstract

Abstract is missing.