An Application of Hindman s Theorem to a Problem on Communication Complexity

Pavel Pudlák. An Application of Hindman s Theorem to a Problem on Communication Complexity. Combinatorics, Probability & Computing, 12(5-6):661-670, 2003.

Abstract

Abstract is missing.