{"id":"https://openalex.org/W4291001791","doi":"https://doi.org/10.1007/s00453-022-01017-8","title":"General Lower Bounds and Improved Algorithms for Infinite\u2013Domain CSPs","display_name":"General Lower Bounds and Improved Algorithms for Infinite\u2013Domain CSPs","publication_year":2022,"publication_date":"2022-08-11","ids":{"openalex":"https://openalex.org/W4291001791","doi":"https://doi.org/10.1007/s00453-022-01017-8"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-01017-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01017-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01017-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01017-8.pdf","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":false,"raw_author_name":"Peter Jonsson","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","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":true,"raw_author_name":"Victor Lagerkvist","raw_affiliation_strings":["Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089123758"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10197203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"85","issue":"1","first_page":"188","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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.9991000294685364,"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.9922999739646912,"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.9897000193595886,"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/algorithm","display_name":"Algorithm","score":0.7682133913040161},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4249511957168579},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32057201862335205}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7682133913040161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4249511957168579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32057201862335205}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-022-01017-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01017-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01017-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:liu-198447","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-198447","pdf_url":"https://liu.diva-portal.org/smash/get/diva2:1804535/FULLTEXT03","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":"doi:10.1007/s00453-022-01017-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01017-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01017-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"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/G5099458896","display_name":null,"funder_award_id":"2021-04371","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/F4320322225","display_name":"Link\u00f6pings Universitet","ror":"https://ror.org/05ynxx418"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4291001791.pdf","grobid_xml":"https://content.openalex.org/works/W4291001791.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W649821374","https://openalex.org/W1495026145","https://openalex.org/W1515598460","https://openalex.org/W1601269853","https://openalex.org/W1741528175","https://openalex.org/W1967190838","https://openalex.org/W1968084296","https://openalex.org/W1974637223","https://openalex.org/W1989358964","https://openalex.org/W2020092346","https://openalex.org/W2041192515","https://openalex.org/W2045982128","https://openalex.org/W2073997125","https://openalex.org/W2087215337","https://openalex.org/W2091637374","https://openalex.org/W2113188188","https://openalex.org/W2133260738","https://openalex.org/W2162593590","https://openalex.org/W2276690803","https://openalex.org/W2407741447","https://openalex.org/W2412677651","https://openalex.org/W2519743841","https://openalex.org/W2582970508","https://openalex.org/W2593619415","https://openalex.org/W2620928019","https://openalex.org/W2803460775","https://openalex.org/W2896772921","https://openalex.org/W2962785950","https://openalex.org/W3023177507","https://openalex.org/W3034994128","https://openalex.org/W3081785465","https://openalex.org/W3103813054","https://openalex.org/W3123582908","https://openalex.org/W3164767989","https://openalex.org/W3174158885","https://openalex.org/W3196775331","https://openalex.org/W6631164824"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W303980170","https://openalex.org/W2351491280","https://openalex.org/W2386767533","https://openalex.org/W2371447506","https://openalex.org/W4225307033"],"abstract_inverted_index":{"Abstract":[0],"We":[1,56],"study":[2],"the":[3,60,111,128,260],"fine-grained":[4],"complexity":[5],"of":[6,17,26,34,42,113,130,264],"NP-complete,":[7],"infinite-domain":[8,36],"constraint":[9],"satisfaction":[10],"problems":[11],"(CSPs)":[12],"parameterised":[13,38],"by":[14,39,270],"a":[15,32,40,47,83,150,223,226,249,274],"set":[16,41],"first-order":[18,43,271],"definable":[19,44],"relations":[20,45],"(with":[21],"equality).":[22,55],"Such":[23],"CSPs":[24,265],"are":[25,118,268],"central":[27],"importance":[28],"since":[29],"they":[30],"form":[31],"subclass":[33],"any":[35],"CSP":[37,84,191,224],"over":[46,85,225,273],"relational":[48],"structure":[49],"(possibly":[50],"containing":[51],"more":[52],"than":[53],"just":[54],"prove":[57,171,221],"that":[58,82,172,222],"under":[59],"randomised":[61],"exponential-time":[62],"hypothesis":[63],"it":[64],"is":[65,91,110,230],"not":[66],"possible":[67,119],"to":[68,156,255,259],"find":[69],"$$c":[70,175],"&gt;":[71,176],"1$$":[72,177],"<mml:math":[73,95,134,178,195,235],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[74,96,135,179,196,236],"<mml:mrow>":[75,97,138,180,197,237],"<mml:mi>c</mml:mi>":[76,101,181,201,241],"<mml:mo>&gt;</mml:mo>":[77,182],"<mml:mn>1</mml:mn>":[78,183],"</mml:mrow>":[79,105,145,184,205,245],"</mml:math>":[80,106,147,185,206,246],"such":[81],"an":[86,162,188],"arbitrary":[87,163],"finite":[88,227],"equality":[89,122,190,228],"language":[90,229],"solvable":[92,192,232],"in":[93,193,233],"$$O(c^n)$$":[94,194,234],"<mml:mi>O</mml:mi>":[98,198,238],"<mml:mo>(</mml:mo>":[99,140,199,239],"<mml:msup>":[100,136,200,240],"<mml:mi>n</mml:mi>":[102,141,143,202,242],"</mml:msup>":[103,146,203,243],"<mml:mo>)</mml:mo>":[104,144,204,244],"time":[107,148,247],"(":[108],"n":[109],"number":[112],"variables).":[114],"Stronger":[115],"lower":[116,151,168],"bounds":[117,169,209],"for":[120,161,173,214,248],"infinite":[121],"languages":[123],"where":[124,266],"we":[125,170,220],"rule":[126],"out":[127],"existence":[129],"$$2^{o(n":[131],"\\log":[132],"n)}$$":[133],"<mml:mn>2</mml:mn>":[137],"<mml:mi>o</mml:mi>":[139],"<mml:mo>log</mml:mo>":[142],"algorithms;":[149],"bound":[152],"which":[153],"also":[154],"extends":[155],"satisfiability":[157],"modulo":[158],"theories":[159],"solving":[160],"background":[164],"theory.":[165],"Despite":[166],"these":[167,211],"each":[174],"there":[186],"exists":[187],"NP-hard":[189],"time.":[207],"Lower":[208],"like":[210],"immediately":[212],"ask":[213],"closely":[215],"matching":[216],"upper":[217],"bounds,":[218],"and":[219,253],"always":[231],"fixed":[250],"c":[251],",":[252],"manage":[254],"extend":[256],"this":[257],"algorithm":[258],"much":[261],"broader":[262],"class":[263],"constraints":[267],"formed":[269],"formulas":[272],"unary":[275],"structure.":[276]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}