The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem
Christoph MeinelStephan WaackPublished in: Universität Trier, Mathematik/Informatik, Forschungsbericht (1994)