{"id":"https://openalex.org/W2964737300","doi":"https://doi.org/10.1109/lics.2019.8785678","title":"A short story of the CSP dichotomy conjecture","display_name":"A short story of the CSP dichotomy conjecture","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2964737300","doi":"https://doi.org/10.1109/lics.2019.8785678","mag":"2964737300"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785678","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785678","pdf_url":"https://ieeexplore.ieee.org/ielx7/8765678/8785654/08785678.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/8765678/8785654/08785678.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108247017","display_name":"Andre\u012d A. Bulatov","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Andrei A. Bulatov","raw_affiliation_strings":["Delft University of Technology, Delft, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108247017"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":0.1928,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53629958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9966999888420105,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7776418924331665},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6232223510742188},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6147071123123169},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6024195551872253},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5513666272163391},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.48939672112464905},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47696101665496826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4662906527519226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46541929244995117},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46481427550315857},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4616357982158661},{"id":"https://openalex.org/keywords/natural","display_name":"Natural (archaeology)","score":0.45538923144340515},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4418693780899048},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.385122150182724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24145320057868958},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15865188837051392}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7776418924331665},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6232223510742188},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6147071123123169},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6024195551872253},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5513666272163391},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.48939672112464905},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47696101665496826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4662906527519226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46541929244995117},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46481427550315857},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4616357982158661},{"id":"https://openalex.org/C2776608160","wikidata":"https://www.wikidata.org/wiki/Q4785462","display_name":"Natural (archaeology)","level":2,"score":0.45538923144340515},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4418693780899048},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.385122150182724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24145320057868958},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15865188837051392},{"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2019.8785678","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785678","pdf_url":"https://ieeexplore.ieee.org/ielx7/8765678/8785654/08785678.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1109/lics.2019.8785678","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785678","pdf_url":"https://ieeexplore.ieee.org/ielx7/8765678/8785654/08785678.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2964737300.pdf","grobid_xml":"https://content.openalex.org/works/W2964737300.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1970318994","https://openalex.org/W1997649256","https://openalex.org/W2020154454","https://openalex.org/W2026753685","https://openalex.org/W2032487621","https://openalex.org/W2052726983","https://openalex.org/W2077575555","https://openalex.org/W2116407296","https://openalex.org/W2166566648","https://openalex.org/W2293541501","https://openalex.org/W2531021157","https://openalex.org/W2793549356","https://openalex.org/W2902878758","https://openalex.org/W2962785950","https://openalex.org/W2963768895","https://openalex.org/W6999413970"],"related_works":["https://openalex.org/W2085484366","https://openalex.org/W2591371812","https://openalex.org/W278676640","https://openalex.org/W1504200807","https://openalex.org/W2296061337","https://openalex.org/W2154884611","https://openalex.org/W4388327399","https://openalex.org/W2327776271","https://openalex.org/W2082636129","https://openalex.org/W2075449032"],"abstract_inverted_index":{"It":[0],"has":[1],"been":[2,95],"observed":[3],"long":[4],"time":[5],"ago":[6],"that":[7,31],"`natural'":[8,16,109],"computational":[9],"problems":[10,51],"tend":[11],"to":[12,97,119],"be":[13],"complete":[14],"in":[15,28,86],"complexity":[17,41,75],"classes":[18,42,125],"such":[19,49,136],"as":[20,74],"NL,":[21],"P,":[22],"NP,":[23],"or":[24],"PSPACE.":[25],"Although":[26],"Ladner":[27],"1975":[29],"proved":[30],"if":[32],"P":[33,78],"\u2260":[34],"NP":[35],"then":[36],"there":[37],"are":[38,52,58],"infinitely":[39],"many":[40],"between":[43],"them,":[44],"all":[45],"the":[46,62,87,105],"examples":[47],"of":[48,89,107,126,135],"intermediate":[50],"based":[53],"on":[54],"diagonalization":[55],"constructions":[56],"and":[57,67,79,103],"very":[59],"artificial.":[60],"Since":[61],"seminal":[63],"work":[64,84],"by":[65],"Feder":[66],"Vardi":[68],"[8]":[69],"this":[70,99],"phenomenon":[71],"is":[72,111,118,133],"known":[73],"dichotomy":[76,121],"(for":[77],"NP),":[80],"see":[81],"also":[82],"Valiant's":[83],"[14]":[85],"context":[88],"counting":[90],"problems.":[91,127],"Concerted":[92],"efforts":[93],"have":[94],"made":[96],"make":[98],"observation":[100],"more":[101],"precise,":[102],"since":[104],"concept":[106],"a":[108,114],"problem":[110,131],"somewhat":[112],"ambiguous,":[113],"possible":[115],"research":[116],"direction":[117],"pursue":[120],"results":[122],"for":[123],"wide":[124],"The":[128],"Constraint":[129],"Satisfaction":[130],"(CSP)":[132],"one":[134],"classes.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-04T06:09:54.619538","created_date":"2025-10-10T00:00:00"}