{"id":"https://openalex.org/W2954569737","doi":"https://doi.org/10.1145/3563820","title":"QCSP Monsters and the Demise of the Chen Conjecture","display_name":"QCSP Monsters and the Demise of the Chen Conjecture","publication_year":2022,"publication_date":"2022-09-15","ids":{"openalex":"https://openalex.org/W2954569737","doi":"https://doi.org/10.1145/3563820","mag":"2954569737"},"language":"en","primary_location":{"id":"doi:10.1145/3563820","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3563820","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5060991122","display_name":"Dmitriy Zhuk","orcid":"https://orcid.org/0000-0003-0047-5076"},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]},{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ","RU"],"is_corresponding":false,"raw_author_name":"Dmitriy Zhuk","raw_affiliation_strings":["Lomonosov Moscow State University, Russia and Charles University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-0047-5076","affiliations":[{"raw_affiliation_string":"Lomonosov Moscow State University, Russia and Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I19880235","https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Barnaby Martin","raw_affiliation_strings":["Durham University, South Road, Durham, UK"],"raw_orcid":"https://orcid.org/0000-0002-4642-8614","affiliations":[{"raw_affiliation_string":"Durham University, South Road, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6796,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.67301748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"69","issue":"5","first_page":"1","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.995199978351593,"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.9943000078201294,"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/conjecture","display_name":"Conjecture","score":0.7423801422119141},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6874232292175293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6805086135864258},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6544022560119629},{"id":"https://openalex.org/keywords/chen","display_name":"Chen","score":0.6336755156517029},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5449305176734924},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47147467732429504},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4533296823501587},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4441553056240082},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44042930006980896},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4213632345199585},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3722165822982788},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.21425920724868774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14753156900405884}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7423801422119141},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6874232292175293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6805086135864258},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6544022560119629},{"id":"https://openalex.org/C2776085556","wikidata":"https://www.wikidata.org/wiki/Q183361","display_name":"Chen","level":2,"score":0.6336755156517029},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5449305176734924},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47147467732429504},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4533296823501587},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4441553056240082},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44042930006980896},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4213632345199585},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3722165822982788},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.21425920724868774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14753156900405884},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3563820","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3563820","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:36752","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/36752/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Journal of the ACM, 2022 [Peer Reviewed Journal]","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1492919123","https://openalex.org/W1497273694","https://openalex.org/W1528746298","https://openalex.org/W1589711670","https://openalex.org/W1968948791","https://openalex.org/W1988790603","https://openalex.org/W1988961015","https://openalex.org/W2012141606","https://openalex.org/W2026753685","https://openalex.org/W2046586055","https://openalex.org/W2073446486","https://openalex.org/W2076946745","https://openalex.org/W2089546742","https://openalex.org/W2149922426","https://openalex.org/W2166566648","https://openalex.org/W2276690803","https://openalex.org/W2324696293","https://openalex.org/W2395088789","https://openalex.org/W2543504241","https://openalex.org/W2592947705","https://openalex.org/W2606192553","https://openalex.org/W2613504727","https://openalex.org/W2729308697","https://openalex.org/W2776885602","https://openalex.org/W2962785950","https://openalex.org/W2962983973","https://openalex.org/W2963666051","https://openalex.org/W2963678585","https://openalex.org/W2963768895","https://openalex.org/W2963983432","https://openalex.org/W3035200231","https://openalex.org/W3106476167","https://openalex.org/W4251337778","https://openalex.org/W4394654843","https://openalex.org/W6864215851"],"related_works":["https://openalex.org/W2085484366","https://openalex.org/W2591371812","https://openalex.org/W1981914472","https://openalex.org/W1535953883","https://openalex.org/W1504200807","https://openalex.org/W278676640","https://openalex.org/W4388327399","https://openalex.org/W2888687131","https://openalex.org/W2296061337","https://openalex.org/W2327776271"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,16,24,60,65,79,84],"surprising":[3],"classification":[4,46],"for":[5,101],"the":[6,10,48,88,98,107,114,125,131],"computational":[7],"complexity":[8,89],"of":[9,110,128],"Quantified":[11],"Constraint":[12],"Satisfaction":[13],"Problem":[14],"over":[15,27],"constraint":[17,66,85],"language":[18,26,67,86],"\u0393,":[19],"QCSP(\u0393),":[20],"where":[21],"\u0393":[22,68,112,129],"is":[23,72,121,138],"finite":[25,102],"three":[28],"elements":[29],"that":[30,57,70],"contains":[31],"all":[32],"constants.":[33],"In":[34],"particular,":[35],"such":[36,69,111],"problems":[37],"are":[38],"in":[39,122],"P,":[40],"NP-complete,":[41],"co-NP-complete,":[42],"or":[43],"PSpace-complete.":[44,139],"Our":[45],"refutes":[47],"hitherto":[49],"widely":[50],"believed":[51],"Chen":[52,99],"Conjecture.":[53],"Additionally,":[54],"we":[55,96],"show":[56],"already":[58],"on":[59,78],"4-element":[61],"domain":[62,81],"there":[63,82],"exists":[64,83],"QCSP(\u0393)":[71,120,137],"DP-complete":[73],"(from":[74],"Boolean":[75],"Hierarchy),":[76],"and":[77,136],"10-element":[80],"giving":[87],"class":[90],"\u0398":[91],"P":[92],"2":[93],".":[94],"Meanwhile,":[95],"prove":[97],"Conjecture":[100],"conservative":[103],"languages":[104],"\u0393.":[105],"If":[106],"polymorphism":[108,126],"clone":[109,127],"has":[113,130],"polynomially":[115],"generated":[116,133],"powers":[117,134],"property,":[118],"then":[119],"NP.":[123],"Otherwise,":[124],"exponentially":[132],"property":[135],"1":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}