{"id":"https://openalex.org/W3035200231","doi":"https://doi.org/10.1145/3357713.3384232","title":"QCSP monsters and the demise of the chen conjecture","display_name":"QCSP monsters and the demise of the chen conjecture","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035200231","doi":"https://doi.org/10.1145/3357713.3384232","mag":"3035200231"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1140982","any_repository_has_fulltext":true},"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"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Dmitriy Zhuk","raw_affiliation_strings":["Moscow State University, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Moscow State University, Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"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, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"91","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"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/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/chen","display_name":"Chen","score":0.8547351360321045},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.8492265939712524},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.783216118812561},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6326703429222107},{"id":"https://openalex.org/keywords/demise","display_name":"Demise","score":0.5819751024246216},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5281298756599426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5232497453689575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4732930064201355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38215112686157227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34752869606018066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23094519972801208},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06939175724983215}],"concepts":[{"id":"https://openalex.org/C2776085556","wikidata":"https://www.wikidata.org/wiki/Q183361","display_name":"Chen","level":2,"score":0.8547351360321045},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.8492265939712524},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.783216118812561},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6326703429222107},{"id":"https://openalex.org/C2777720223","wikidata":"https://www.wikidata.org/wiki/Q5255430","display_name":"Demise","level":2,"score":0.5819751024246216},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5281298756599426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5232497453689575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4732930064201355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38215112686157227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34752869606018066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23094519972801208},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06939175724983215},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3357713.3384232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:31261","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/31261/","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":"Makarychev, Konstantin & Makarychev, Yury & Tulsiani, Madhur & Kamath, Gautam & Chuzhoy, Julia (Eds.). Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. New York: Association for Computing Machinery, pp. 91-104","raw_type":"Book chapter"},{"id":"pmh:oai:durham-repository.worktribe.com:1140982","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1140982","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1140982","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1140982","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3731793528","display_name":null,"funder_award_id":"19-01-00200","funder_id":"https://openalex.org/F4320313621","funder_display_name":"Russian Foundation for Fundamental Investigations"},{"id":"https://openalex.org/G5562508264","display_name":null,"funder_award_id":"771005","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"}],"funders":[{"id":"https://openalex.org/F4320313621","display_name":"Russian Foundation for Fundamental Investigations","ror":null},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1492919123","https://openalex.org/W1497273694","https://openalex.org/W1968948791","https://openalex.org/W1988790603","https://openalex.org/W2046586055","https://openalex.org/W2089546742","https://openalex.org/W2138627415","https://openalex.org/W2149922426","https://openalex.org/W2153967966","https://openalex.org/W2324696293","https://openalex.org/W2395088789","https://openalex.org/W2543504241","https://openalex.org/W2592947705","https://openalex.org/W2613504727","https://openalex.org/W2729308697","https://openalex.org/W2776885602","https://openalex.org/W2962785950","https://openalex.org/W2963678585","https://openalex.org/W2963768895","https://openalex.org/W2963983432","https://openalex.org/W4206245034"],"related_works":["https://openalex.org/W2592565992","https://openalex.org/W2631115212","https://openalex.org/W584232556","https://openalex.org/W2053301901","https://openalex.org/W1601384981","https://openalex.org/W2284868610","https://openalex.org/W2808367673","https://openalex.org/W2132301514","https://openalex.org/W2556223399","https://openalex.org/W3121583437"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,16,24],"surprising":[3],"classification":[4,47],"for":[5],"the":[6,10,49],"computational":[7],"complexity":[8],"of":[9],"Quantified":[11],"Constraint":[12],"Satisfaction":[13],"Problem":[14],"over":[15,27],"constraint":[17],"language":[18,26],"\u0393,":[19],"QCSP(\u0393),":[20],"where":[21],"\u0393":[22],"is":[23],"finite":[25],"3":[28],"elements":[29],"which":[30],"contains":[31],"all":[32],"constants.":[33],"In":[34],"particular,":[35],"such":[36],"problems":[37],"are":[38],"either":[39],"in":[40],"P,":[41],"NP-complete,":[42],"co-NP-complete":[43],"or":[44],"PSpace-complete.":[45],"Our":[46],"refutes":[48],"hitherto":[50],"widely-believed":[51],"Chen":[52],"Conjecture.":[53]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}