An application of Hindman's theorem to a problem on communication complexity

Combinatorics Probability and Computing

Volumn 12, Issue 5-6 SPEC. ISS., 2003, Pages 661-670

  Pudlák, Pavel ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; NUMBER THEORY; PROBLEM SOLVING; SET THEORY;

COMMUNICATION COMPLEXITY; HINDMAN'S THEOREM;

THEOREM PROVING;

EID: 2942515142     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005790     Document Type: Article

References (5)

1. Hindman, N. (1974) Finite sums from sequences within cells of a partition of N. J. Combin. Theory Ser. A 17 1-11.
2. Kushilevitz, E. and Nisan, N. (1977) Communication Complexity, Cambridge University Press.
3. Lovász, L. (1979) Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest.
4. Milliken, K. R. (1975) Ramsey's theorem with sums or unions. J. Combin. Theory Ser. A 18 276-290.
5. Raymond, J.-F., Tesson, P. and Thérien, D. (1998) An algebraic approach to communication complexity. In ICALP'98, Vol. 1443 of Lecture Notes in Computer Science, Springer, pp. 29-40.