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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.