{"id":"https://openalex.org/W1991486497","doi":"https://doi.org/10.1137/100811258","title":"An Effective Dichotomy for the Counting Constraint Satisfaction Problem","display_name":"An Effective Dichotomy for the Counting Constraint Satisfaction Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1991486497","doi":"https://doi.org/10.1137/100811258","mag":"1991486497"},"language":"en","primary_location":{"id":"doi:10.1137/100811258","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100811258","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/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":true,"raw_author_name":"Martin Dyer","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, LS2 9JT, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, LS2 9JT, UK","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/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"David Richerby","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, L69 3BX, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, L69 3BX, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019297501"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":null,"apc_paid":null,"fwci":7.2623,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.97453322,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"42","issue":"3","first_page":"1245","last_page":"1274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"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.7398044466972351},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6594276428222656},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6416947245597839},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.6185358762741089},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5055005550384521},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.42316144704818726},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4183367192745209},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3631041944026947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1211271584033966}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7398044466972351},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6594276428222656},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6416947245597839},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.6185358762741089},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5055005550384521},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.42316144704818726},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4183367192745209},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3631041944026947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1211271584033966},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100811258","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100811258","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"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"},{"id":"https://openalex.org/G3568867679","display_name":null,"funder_award_id":"EP/I012087/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":31,"referenced_works":["https://openalex.org/W1120761376","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/W2011398524","https://openalex.org/W2012753562","https://openalex.org/W2017724352","https://openalex.org/W2026745535","https://openalex.org/W2026753685","https://openalex.org/W2033026830","https://openalex.org/W2040145343","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/W2134273915","https://openalex.org/W2134600856","https://openalex.org/W2145707075","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2151536080","https://openalex.org/W2166566648","https://openalex.org/W3124201190","https://openalex.org/W4254380579"],"related_works":["https://openalex.org/W4234189135","https://openalex.org/W2170336571","https://openalex.org/W4253538798","https://openalex.org/W2489809986","https://openalex.org/W3022248317","https://openalex.org/W1525372385","https://openalex.org/W1693995122","https://openalex.org/W2583777943","https://openalex.org/W3024140877","https://openalex.org/W2585890227"],"abstract_inverted_index":{"Bulatov":[0,75,181],"[Proceedings":[1],"of":[2,51,60,73,80,85,87,118,126,137,140,170],"the":[3,30,61,78,82,155,197,224,229,235],"$35$th":[4],"International":[5],"Colloquium":[6],"on":[7,105,130],"Automata,":[8],"Languages":[9],"and":[10,110,182,205],"Programming":[11],"(Part":[12],"1),":[13],"Lecture":[14],"Notes":[15],"in":[16,94,218],"Comput.":[17],"Sci.":[18],"5125,":[19],"Springer,":[20],"New":[21],"York,":[22],"2008,":[23],"pp.":[24,189],"646--661]":[25],"gave":[26],"a":[27,43,47,54,115,138,161,168,171,193],"dichotomy":[28,225],"for":[29,174,196],"counting":[31,81],"constraint":[32,44,177],"satisfaction":[33],"problem":[34,37,62,79,89],"\\#CSP.":[35],"A":[36],"from":[38,90,107],"\\#CSP":[39,91,236],"is":[40,92,99,211,226],"characterized":[41],"by":[42],"language":[45],"$\\Gamma\\!$,":[46],"fixed,":[48],"finite":[49,55,71],"set":[50,72],"relations":[52,65,156],"over":[53],"domain":[56],"$D$.":[57],"An":[58],"instance":[59],"uses":[63],"these":[64,152],"to":[66,180],"constrain":[67],"an":[68,123],"arbitrarily":[69],"large":[70],"variables.":[74],"showed":[76],"that":[77,119,151,208,223],"satisfying":[83],"assignments":[84],"instances":[86],"any":[88],"either":[93],"polynomial":[95],"time":[96],"(FP)":[97],"or":[98],"\\#P-complete.":[100],"His":[101],"proof":[102,125],"draws":[103],"heavily":[104],"techniques":[106],"universal":[108],"algebra":[109],"cannot":[111],"be":[112],"understood":[113],"without":[114],"secure":[116],"grasp":[117],"field.":[120],"We":[121,149,191],"give":[122,167],"elementary":[124],"Bulatov's":[127],"dichotomy,":[128,199],"based":[129],"succinct":[131],"representations,":[132],"which":[133,144,157,200],"we":[134,145,166,201,206,215,221],"call":[135,146,202],"frames,":[136],"class":[139],"highly":[141],"structured":[142],"relations,":[143],"strongly":[147,175],"rectangular.":[148],"show":[150,222],"are":[153,158],"precisely":[154],"invariant":[159],"under":[160],"Mal'tsev":[162],"polymorphism.":[163],"En":[164],"route,":[165],"simplification":[169],"decision":[172],"algorithm":[173],"rectangular":[176],"languages":[178],"due":[179],"Dalmau":[183],"[SIAM":[184],"J.":[185],"Comput.,":[186],"36":[187],"(2006),":[188],"16--27].":[190],"establish":[192,216],"new":[194],"criterion":[195],"#CSP":[198],"strong":[203],"balance,":[204],"prove":[207],"this":[209],"property":[210],"decidable.":[212],"In":[213],"fact,":[214],"membership":[217],"NP.":[219],"Thus,":[220],"effective,":[227],"resolving":[228],"most":[230],"important":[231],"open":[232],"question":[233],"concerning":[234],"dichotomy.":[237]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-01T08:55:55.761014","created_date":"2025-10-10T00:00:00"}