The communication complexity of the Exact-N Problem revisited

William I. Gasarch, James Glenn, Andrey Utis. The communication complexity of the Exact-N Problem revisited. In Harry Buhrman, Lance Fortnow, Thomas Thierauf, editors, Algebraic Methods in Computational Complexity, 10.-15. October 2004. Volume 04421 of Dagstuhl Seminar Proceedings, IBFI, Schloss Dagstuhl, Germany, 2004. [doi]

Abstract

Abstract is missing.