Skip to main content
Conference Proceedings

Unexpected upper bounds on the complexity of some communication games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 820 LNCS 1-10
DOI: 10.1007/3-540-58201-0_53
4Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Pudlák, P. (1994). Unexpected upper bounds on the complexity of some communication games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 820 LNCS, pp. 1–10). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free