{"id":"https://openalex.org/W2159517059","doi":"https://doi.org/10.1017/s0963548303005790","title":"An Application of Hindman's Theorem to a Problem on Communication Complexity","display_name":"An Application of Hindman's Theorem to a Problem on Communication Complexity","publication_year":2003,"publication_date":"2003-11-01","ids":{"openalex":"https://openalex.org/W2159517059","doi":"https://doi.org/10.1017/s0963548303005790","mag":"2159517059"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548303005790","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548303005790","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109848440","display_name":"Pavel Pudl\u00e1k","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pavel Pudl\u00e1k","raw_affiliation_strings":["Mathematical Institute, Academy of Sciences, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, Academy of Sciences, Prague, Czech Republic","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109848440"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1838,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88379417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"12","issue":"5-6","first_page":"661","last_page":"670"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.5870761871337891},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5160021781921387},{"id":"https://openalex.org/keywords/word-problem","display_name":"Word problem (mathematics education)","score":0.5086835026741028},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5062955617904663},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4696820378303528},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4561433792114258},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.43427032232284546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4099813997745514},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35184353590011597},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.19210365414619446}],"concepts":[{"id":"https://openalex.org/C112291201","wikidata":"https://www.wikidata.org/wiki/Q1336170","display_name":"Ramsey theory","level":2,"score":0.5870761871337891},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5160021781921387},{"id":"https://openalex.org/C90988201","wikidata":"https://www.wikidata.org/wiki/Q255912","display_name":"Word problem (mathematics education)","level":2,"score":0.5086835026741028},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5062955617904663},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4696820378303528},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4561433792114258},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.43427032232284546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4099813997745514},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35184353590011597},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.19210365414619446},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548303005790","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548303005790","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1880767675","https://openalex.org/W1997681421","https://openalex.org/W2047891343","https://openalex.org/W2340787257"],"related_works":["https://openalex.org/W4310527795","https://openalex.org/W4235762796","https://openalex.org/W2800057389","https://openalex.org/W2970986883","https://openalex.org/W2937816712","https://openalex.org/W1995096030","https://openalex.org/W2952859614","https://openalex.org/W2940671439","https://openalex.org/W4301871063","https://openalex.org/W2465912158"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,8,18,26,46,50,54,57],"k":[3],"-party":[4],"communication":[5,47],"complexity":[6,48],"of":[7,10,17,29,37,49,56],"problem":[9,51],"determining":[11],"if":[12],"a":[13],"word":[14,58],"w":[15,59],"is":[16],"form":[19],",":[20],"for":[21,43],"fixed":[22],"letters":[23],".":[24,60],"Using":[25],"well-known":[27],"theorem":[28],"Hindman":[30],"(a":[31],"Ramsey-type":[32],"result":[33],"about":[34],"finite":[35],"subsets":[36],"natural":[38],"numbers),":[39],"we":[40],"prove":[41],"that":[42],"and":[44],"5":[45],"increases":[52],"with":[53],"length":[55]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}