{"id":"https://openalex.org/W3123582908","doi":"https://doi.org/10.1145/3434387","title":"Fine-Grained Time Complexity of Constraint Satisfaction Problems","display_name":"Fine-Grained Time Complexity of Constraint Satisfaction Problems","publication_year":2021,"publication_date":"2021-01-21","ids":{"openalex":"https://openalex.org/W3123582908","doi":"https://doi.org/10.1145/3434387","mag":"3123582908"},"language":"en","primary_location":{"id":"doi:10.1145/3434387","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3434387","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":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-175094","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101920004","display_name":"Peter J\u00f6nsson","orcid":"https://orcid.org/0000-0002-5288-3330"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Jonsson","raw_affiliation_strings":["Link\u00f6ping University, \u00d6sterg\u00f6tland, Sweden"],"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, \u00d6sterg\u00f6tland, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089123758","display_name":"Victor Lagerkvist","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Victor Lagerkvist","raw_affiliation_strings":["Link\u00f6ping University, \u00d6sterg\u00f6tland, Sweden"],"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, \u00d6sterg\u00f6tland, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007248485","display_name":"Biman Kumar Saha Roy","orcid":"https://orcid.org/0000-0002-4250-5440"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Biman Roy","raw_affiliation_strings":["Independent Researcher, \u00d6sterg\u00f6tland, Sweden"],"affiliations":[{"raw_affiliation_string":"Independent Researcher, \u00d6sterg\u00f6tland, Sweden","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101920004"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.6112,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68036614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":96},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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.9995999932289124,"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.9991000294685364,"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.9815000295639038,"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/unary-operation","display_name":"Unary operation","score":0.8936145305633545},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8583787679672241},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7589076161384583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5939690470695496},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5886053442955017},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.5877566337585449},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5847941040992737},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5706437826156616},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5439091324806213},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5151444673538208},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49633532762527466},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.47749587893486023},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.43834444880485535},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43468204140663147},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4318963289260864},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35836559534072876},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.3499049246311188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25888386368751526}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8936145305633545},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8583787679672241},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7589076161384583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5939690470695496},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5886053442955017},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.5877566337585449},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5847941040992737},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5706437826156616},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5439091324806213},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5151444673538208},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49633532762527466},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.47749587893486023},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.43834444880485535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43468204140663147},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4318963289260864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35836559534072876},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.3499049246311188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25888386368751526},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3434387","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3434387","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"},{"id":"pmh:oai:DiVA.org:liu-175094","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-175094","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:liu-175094","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-175094","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2488160141","display_name":null,"funder_award_id":"2019-03690","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G8024612177","display_name":null,"funder_award_id":"2017-04112","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W581895261","https://openalex.org/W1009693448","https://openalex.org/W1527904224","https://openalex.org/W1565722675","https://openalex.org/W1571197496","https://openalex.org/W1589711670","https://openalex.org/W1618174268","https://openalex.org/W1965580474","https://openalex.org/W1967190838","https://openalex.org/W1974637223","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2013544047","https://openalex.org/W2018470381","https://openalex.org/W2025319967","https://openalex.org/W2026753685","https://openalex.org/W2029350735","https://openalex.org/W2032487621","https://openalex.org/W2087215337","https://openalex.org/W2111161140","https://openalex.org/W2114994281","https://openalex.org/W2119165365","https://openalex.org/W2125216182","https://openalex.org/W2133260738","https://openalex.org/W2145842374","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2180459618","https://openalex.org/W2243954424","https://openalex.org/W2245690396","https://openalex.org/W2276690803","https://openalex.org/W2285982983","https://openalex.org/W2407741447","https://openalex.org/W2504838369","https://openalex.org/W2519743841","https://openalex.org/W2561675875","https://openalex.org/W2582970508","https://openalex.org/W2592770497","https://openalex.org/W2605361762","https://openalex.org/W2606192553","https://openalex.org/W2740483412","https://openalex.org/W2949926007","https://openalex.org/W2962785950","https://openalex.org/W2963768895","https://openalex.org/W3015502884","https://openalex.org/W3023528124","https://openalex.org/W3040974471","https://openalex.org/W4251337778","https://openalex.org/W4389615669","https://openalex.org/W6677879094","https://openalex.org/W6886175930"],"related_works":["https://openalex.org/W2045729033","https://openalex.org/W4241669499","https://openalex.org/W2183565733","https://openalex.org/W2137855809","https://openalex.org/W2152388474","https://openalex.org/W2295056692","https://openalex.org/W2784687883","https://openalex.org/W2091348864","https://openalex.org/W179383408","https://openalex.org/W3123582908"],"abstract_inverted_index":{"We":[0,96],"study":[1],"the":[2,16,26,33,74,78,100,114,124],"constraint":[3,10],"satisfaction":[4],"problem":[5,80],"(CSP)":[6],"parameterized":[7],"by":[8],"a":[9,68,86],"language":[11],"\u0393":[12,19],"(CSP\u0393)":[13],"and":[14,49,59,118],"how":[15],"choice":[17],"of":[18,35,77,93,103],"affects":[20],"its":[21],"worst-case":[22],"time":[23,75,101],"complexity.":[24],"Under":[25],"exponential-time":[27],"hypothesis":[28],"(ETH),":[29],"we":[30,66],"rule":[31],"out":[32],"existence":[34],"subexponential":[36],"algorithms":[37],"for":[38,89],"finite-domain":[39],"NP-complete":[40,79,91],"CSP\u0393":[41],"problems.":[42,52],"This":[43],"extends":[44],"to":[45],"certain":[46],"infinite-domain":[47],"CSPs":[48,54,92],"structurally":[50],"restricted":[51],"For":[53],"with":[55],"finite":[56],"domain":[57],"D":[58,71,83,106],"where":[60],"all":[61,90],"unary":[62],"relations":[63],"are":[64],"available,":[65],"identify":[67],"relation":[69],"S":[70,82,105],"such":[72],"that":[73,99],"complexity":[76,102,121],"CSP({":[81,104],"})":[84,107],"is":[85,116],"lower":[87],"bound":[88],"this":[94],"kind.":[95],"also":[97],"prove":[98],"strictly":[108],"decreases":[109],"when":[110,127],"|D|":[111],"increases":[112],"(unless":[113],"ETH":[115],"false)":[117],"provide":[119],"stronger":[120],"results":[122],"in":[123],"special":[125],"case":[126],"|D|=3.":[128]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}