{"id":"https://openalex.org/W2058673868","doi":"https://doi.org/10.1145/1806689.1806789","title":"On the complexity of #CSP","display_name":"On the complexity of #CSP","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2058673868","doi":"https://doi.org/10.1145/1806689.1806789","mag":"2058673868"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806789","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin E. Dyer","raw_affiliation_strings":["University of Leeds, Leeds, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Leeds, Leeds, United Kingdom","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074554452","display_name":"David Richerby","orcid":"https://orcid.org/0000-0003-1062-8451"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David M. Richerby","raw_affiliation_strings":["University of Leeds, Leeds, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Leeds, Leeds, United Kingdom","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":null,"apc_paid":null,"fwci":10.3319,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.99138344,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"725","last_page":"734"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9980000257492065,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9972000122070312,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8885515928268433},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5975608825683594},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5810872316360474},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5225074887275696},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.49172380566596985},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4776231646537781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4589806795120239},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.45180854201316833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4467252492904663},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44661420583724976},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4365270435810089},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.43302828073501587},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4233204424381256},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3999583423137665},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38966721296310425},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.2774900197982788},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18167415261268616},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14740023016929626},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10120970010757446}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8885515928268433},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5975608825683594},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5810872316360474},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5225074887275696},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.49172380566596985},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4776231646537781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4589806795120239},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.45180854201316833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4467252492904663},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44661420583724976},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4365270435810089},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.43302828073501587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4233204424381256},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3999583423137665},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38966721296310425},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.2774900197982788},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18167415261268616},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14740023016929626},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10120970010757446},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1806689.1806789","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G3228783945","display_name":null,"funder_award_id":"EP/E062172/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W253183949","https://openalex.org/W1120761376","https://openalex.org/W1524176804","https://openalex.org/W1559445597","https://openalex.org/W1813513278","https://openalex.org/W1983032729","https://openalex.org/W1993953362","https://openalex.org/W1997649256","https://openalex.org/W2003895694","https://openalex.org/W2006912660","https://openalex.org/W2012753562","https://openalex.org/W2026745535","https://openalex.org/W2026753685","https://openalex.org/W2052936500","https://openalex.org/W2077575555","https://openalex.org/W2091345559","https://openalex.org/W2097738137","https://openalex.org/W2115826669","https://openalex.org/W2118223706","https://openalex.org/W2131358503","https://openalex.org/W2141321698","https://openalex.org/W2145707075","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2151536080","https://openalex.org/W2166566648","https://openalex.org/W2504389667","https://openalex.org/W3124201190"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2161128834","https://openalex.org/W1550482496","https://openalex.org/W2012141606","https://openalex.org/W3122034878","https://openalex.org/W2137855809","https://openalex.org/W2097415053","https://openalex.org/W2295056692"],"abstract_inverted_index":{"Bulatov":[0,55],"(2008)":[1],"has":[2],"given":[3],"a":[4,20,26,33,50,107],"dichotomy":[5],"for":[6,58],"the":[7,39,46,62,66,86,89],"counting":[8,65],"constraint":[9,21,90],"satisfaction":[10],"problem,":[11],"#CSP.":[12],"A":[13],"problem":[14,40,63,73],"from":[15,74,99],"#CSP":[16,75],"is":[17,25,76],"characterized":[18],"by":[19,49],"language":[22,91],"\u03b3,":[23,61],"which":[24],"fixed,":[27],"finite":[28,34,51],"set":[29,52],"of":[30,38,53,64,69,71,88,110],"relations":[31,43],"over":[32],"domain.":[35],"An":[36],"instance":[37],"uses":[41],"these":[42],"to":[44],"constrain":[45],"values":[47],"taken":[48],"variables.":[54],"showed":[56],"that,":[57],"any":[59,72],"fixed":[60],"satisfying":[67],"assignments":[68],"instances":[70],"either":[77],"in":[78],"polynomial":[79],"time":[80],"(FP)":[81],"or":[82],"#P-complete,":[83],"according":[84],"on":[85,97],"structure":[87],"\u03b3.":[92],"His":[93],"proof":[94],"draws":[95],"heavily":[96],"techniques":[98],"universal":[100],"algebra":[101],"and":[102],"cannot":[103],"be":[104],"understood":[105],"without":[106],"secure":[108],"grasp":[109],"that":[111],"field.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}