{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:53:42Z","timestamp":1649098422091},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T00:00:00Z","timestamp":1070409600000},"content-version":"unspecified","delay-in-days":32,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2003,11]]},"abstract":"<jats:p>We consider the <jats:italic>k<\/jats:italic>-party communication complexity of the problem of determining if a word <jats:italic>w<\/jats:italic> is of the form <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548303005790_inline1.png\" \/>, for fixed letters <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548303005790_inline2.png\" \/>. Using the well-known theorem of Hindman (a Ramsey-type result about finite subsets of natural numbers), we prove that for <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" mimetype=\"image\" xlink:href=\"S0963548303005790_inline3.png\" \/> and 5 the communication complexity of the problem increases with the length of the word <jats:italic>w<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s0963548303005790","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T14:23:14Z","timestamp":1070461394000},"page":"661-670","source":"Crossref","is-referenced-by-count":4,"title":["An Application of Hindman's Theorem to a Problem on Communication Complexity"],"prefix":"10.1017","volume":"12","author":[{"given":"Pavel","family":"Pudl\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2003,12,3]]},"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548303005790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T09:22:41Z","timestamp":1589534561000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548303005790\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":0,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0963548303005790"],"URL":"https:\/\/doi.org\/10.1017\/s0963548303005790","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}