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]

@inproceedings{GasarchGU04,
  title = {The communication complexity of the Exact-N Problem revisited},
  author = {William I. Gasarch and James Glenn and Andrey Utis},
  year = {2004},
  url = {http://drops.dagstuhl.de/opus/volltexte/2005/102},
  researchr = {https://researchr.org/publication/GasarchGU04},
  cites = {0},
  citedby = {0},
  booktitle = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
  editor = {Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  volume = {04421},
  series = {Dagstuhl Seminar Proceedings},
  publisher = {IBFI, Schloss Dagstuhl, Germany},
}