{"id":"https://openalex.org/W2963295189","doi":"https://doi.org/10.1145/3134757","title":"Asking the Metaquestions in Constraint Tractability","display_name":"Asking the Metaquestions in Constraint Tractability","publication_year":2017,"publication_date":"2017-09-30","ids":{"openalex":"https://openalex.org/W2963295189","doi":"https://doi.org/10.1145/3134757","mag":"2963295189"},"language":"en","primary_location":{"id":"doi:10.1145/3134757","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3134757","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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":"ACM Transactions on Computation Theory","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/A5110074953","display_name":"Hubie Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I110594554","display_name":"Ikerbasque","ror":"https://ror.org/01cc3fy72","country_code":"ES","type":"other","lineage":["https://openalex.org/I110594554"]},{"id":"https://openalex.org/I169108374","display_name":"University of the Basque Country","ror":"https://ror.org/000xsnr85","country_code":"ES","type":"education","lineage":["https://openalex.org/I169108374"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Hubie Chen","raw_affiliation_strings":["Universidad del Pa\u00eds Vasco and IKERBASQUE, Basque Foundation for Science, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad del Pa\u00eds Vasco and IKERBASQUE, Basque Foundation for Science, Spain","institution_ids":["https://openalex.org/I110594554","https://openalex.org/I169108374"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016192081","display_name":"Beno\u00eet Larose","orcid":null},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]},{"id":"https://openalex.org/I94782393","display_name":"Champlain Regional College","ror":"https://ror.org/0153jrn34","country_code":"CA","type":"education","lineage":["https://openalex.org/I94782393"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Benoit Larose","raw_affiliation_strings":["Champlain Regional College and Universit\u00e9 du Qu\u00e9bec a Montr\u00e9al"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Champlain Regional College and Universit\u00e9 du Qu\u00e9bec a Montr\u00e9al","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I94782393"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7451,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.91781834,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":"3","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9993000030517578,"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.9993000030517578,"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.9958999752998352,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9176999926567078,"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.7886455059051514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6541272401809692},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6468979716300964},{"id":"https://openalex.org/keywords/algebraic-structure","display_name":"Algebraic structure","score":0.542962908744812},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5258229970932007},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48982688784599304},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4623471796512604},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4536943733692169},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4349874258041382},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4302069842815399},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41291943192481995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25216007232666016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14789164066314697},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09886384010314941}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7886455059051514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6541272401809692},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6468979716300964},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.542962908744812},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5258229970932007},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48982688784599304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4623471796512604},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4536943733692169},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4349874258041382},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4302069842815399},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41291943192481995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25216007232666016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14789164066314697},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09886384010314941},{"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},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3134757","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3134757","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W1440223313","https://openalex.org/W1486752157","https://openalex.org/W1511747486","https://openalex.org/W1513187261","https://openalex.org/W1528746298","https://openalex.org/W1570219696","https://openalex.org/W1964678328","https://openalex.org/W1965377399","https://openalex.org/W1969223164","https://openalex.org/W1972179987","https://openalex.org/W1976017655","https://openalex.org/W1978292808","https://openalex.org/W1983032729","https://openalex.org/W1995102370","https://openalex.org/W2001101327","https://openalex.org/W2009379153","https://openalex.org/W2020154454","https://openalex.org/W2026753685","https://openalex.org/W2027524199","https://openalex.org/W2028019552","https://openalex.org/W2032487621","https://openalex.org/W2035932556","https://openalex.org/W2041890562","https://openalex.org/W2046586055","https://openalex.org/W2052726983","https://openalex.org/W2053204108","https://openalex.org/W2055594915","https://openalex.org/W2066776015","https://openalex.org/W2067706177","https://openalex.org/W2076946745","https://openalex.org/W2091694652","https://openalex.org/W2124452950","https://openalex.org/W2150339067","https://openalex.org/W2151577278","https://openalex.org/W2156215965","https://openalex.org/W2166566648","https://openalex.org/W2173530240","https://openalex.org/W2241862190","https://openalex.org/W2253270855","https://openalex.org/W2271628119","https://openalex.org/W2314918483","https://openalex.org/W2568552169","https://openalex.org/W2572503304","https://openalex.org/W2964190293","https://openalex.org/W3105727132","https://openalex.org/W4235890131","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4308159138","https://openalex.org/W1979798674","https://openalex.org/W4327811209","https://openalex.org/W3169947911","https://openalex.org/W2180376884","https://openalex.org/W2138335839","https://openalex.org/W2129131081","https://openalex.org/W4313227175","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"The":[0,69,99],"constraint":[1],"satisfaction":[2],"problem":[3,43,80,97,100,119],"(CSP)":[4],"involves":[5],"deciding,":[6,45],"given":[7,46,167],"a":[8,13,47,59,74,96,122,166,171,185],"set":[9,14,123],"of":[10,15,32,37,44,51,117,124,129,133,142,157,161,183,199],"variables":[11,29],"and":[12,114,144],"constraints":[16],"on":[17],"the":[18,28,33,38,42,62,66,84,112,126,139,174,181,190,197],"variables,":[19],"whether":[20,54,163],"or":[21,55,164],"not":[22,56,165],"there":[23,57],"is":[24,40,58,71,81],"an":[25,107],"assignment":[26],"to":[27,65,77,82,95,121,137,148,188],"satisfying":[30],"all":[31],"constraints.":[34],"One":[35],"formulation":[36],"CSP":[39,70],"as":[41,194,196],"pair":[48],"(G":[49],"\u210d)":[50],"relational":[52],"structures,":[53],"homomorphism":[60],"from":[61,173],"first":[63],"structure":[64,86,91,168],"second":[67,85],"structure.":[68],"generally":[72],"NP-hard;":[73],"common":[75],"way":[76],"restrict":[78],"this":[79],"fix":[83],"\u210d":[87,92,169],"so":[88],"that":[89],"each":[90,118],"gives":[93],"rise":[94],"CSP(\u210d).":[98],"family":[101],"CSP(\u210d)":[102,120,202],"has":[103,203],"been":[104],"studied":[105],"using":[106],"algebraic":[108],"approach,":[109],"which":[110],"links":[111],"algorithmic":[113],"complexity":[115,160],"properties":[116],"operations,":[125],"so-called":[127],"polymorphisms":[128,134],"\u210d.":[130],"Certain":[131],"types":[132],"are":[135,146],"known":[136],"imply":[138],"polynomial-time":[140],"tractability":[141],"CSP(\u210d),":[143,193],"others":[145],"conjectured":[147,187],"do":[149],"so.":[150],"This":[151],"article":[152],"systematically":[153],"studies\u2014for":[154],"various":[155],"classes":[156],"polymorphisms\u2014the":[158],"computational":[159],"deciding":[162,184,200],"admits":[170],"polymorphism":[172],"class.":[175],"Among":[176],"other":[177],"results,":[178],"we":[179],"prove":[180],"NP-completeness":[182,198],"condition":[186],"characterize":[189],"tractable":[191],"problems":[192],"well":[195],"if":[201],"bounded":[204],"width.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}