Unexpected Upper Bounds on the Complexity of Some Communication Games

Pavel Pudlák. Unexpected Upper Bounds on the Complexity of Some Communication Games. In Serge Abiteboul, Eli Shamir, editors, Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings. Volume 820 of Lecture Notes in Computer Science, pages 1-10, Springer, 1994.

@inproceedings{Pudlak94,
  title = {Unexpected Upper Bounds on the Complexity of Some Communication Games},
  author = {Pavel Pudlák},
  year = {1994},
  researchr = {https://researchr.org/publication/Pudlak94},
  cites = {0},
  citedby = {0},
  pages = {1-10},
  booktitle = {Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
  editor = {Serge Abiteboul and Eli Shamir},
  volume = {820},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-58201-0},
}