{"id":"https://openalex.org/W3023177507","doi":"https://doi.org/10.1145/3389411","title":"Sparsification of SAT and CSP Problems via Tractable Extensions","display_name":"Sparsification of SAT and CSP Problems via Tractable Extensions","publication_year":2020,"publication_date":"2020-04-26","ids":{"openalex":"https://openalex.org/W3023177507","doi":"https://doi.org/10.1145/3389411","mag":"3023177507"},"language":"en","primary_location":{"id":"doi:10.1145/3389411","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3389411","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-171236","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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, Link\u00f6ping, \u00d6sterg\u00f6tland, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping University, Link\u00f6ping, \u00d6sterg\u00f6tland, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001475076","display_name":"Magnus Wahlstr\u00f6m","orcid":"https://orcid.org/0000-0002-0933-4504"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Magnus Wahlstr\u00f6m","raw_affiliation_strings":["Royal Holloway, University of London, Egham Hill, Egham, Great Britain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham Hill, Egham, Great Britain","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6332,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74246314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"12","issue":"2","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"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/mathematics","display_name":"Mathematics","score":0.6753048896789551},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6254112720489502},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5745318531990051},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4869283437728882},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47148606181144714},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4482482075691223},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.43904048204421997},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4314204454421997},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3358120620250702},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2507264018058777}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6753048896789551},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6254112720489502},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5745318531990051},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4869283437728882},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47148606181144714},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4482482075691223},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.43904048204421997},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4314204454421997},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3358120620250702},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2507264018058777},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3389411","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3389411","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-171236","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-171236","pdf_url":null,"source":{"id":"https://openalex.org/S4306400838","display_name":"DiVA (Linkoping University)","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":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:liu-171236","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-171236","pdf_url":null,"source":{"id":"https://openalex.org/S4306400838","display_name":"DiVA (Linkoping University)","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":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1909439116","https://openalex.org/W1974637223","https://openalex.org/W1978292808","https://openalex.org/W1983032729","https://openalex.org/W1991486497","https://openalex.org/W1995725694","https://openalex.org/W2008809414","https://openalex.org/W2013415302","https://openalex.org/W2018470381","https://openalex.org/W2023648368","https://openalex.org/W2025319967","https://openalex.org/W2026753685","https://openalex.org/W2034437384","https://openalex.org/W2052726983","https://openalex.org/W2084944875","https://openalex.org/W2107918022","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2170491051","https://openalex.org/W2245690396","https://openalex.org/W2253657605","https://openalex.org/W2324696293","https://openalex.org/W2512056759","https://openalex.org/W2519743841","https://openalex.org/W2561675875","https://openalex.org/W2569790754","https://openalex.org/W2787688160","https://openalex.org/W2909144890","https://openalex.org/W2914414140","https://openalex.org/W2962785950","https://openalex.org/W2963768895","https://openalex.org/W4247937681","https://openalex.org/W4251337778","https://openalex.org/W4293176479"],"related_works":["https://openalex.org/W2077122242","https://openalex.org/W415013543","https://openalex.org/W1577976412","https://openalex.org/W3081808117","https://openalex.org/W3215419002","https://openalex.org/W3005294169","https://openalex.org/W8486670","https://openalex.org/W1876800908","https://openalex.org/W2071423034","https://openalex.org/W3023177507"],"abstract_inverted_index":{"Unlike":[0],"polynomial":[1,48,206,224,348],"kernelization":[2],"in":[3,226],"general,":[4],"for":[5,19,52,71,151,178,234,241,316,341],"which":[6,173],"many":[7],"non-trivial":[8,99],"results":[9,37],"and":[10],"methods":[11],"exist,":[12],"only":[13],"few":[14],"non-trival":[15],"algorithms":[16,150],"are":[17],"known":[18,64,77,149],"polynomial-time":[20,100],"sparsification.":[21],"Furthermore,":[22],"excepting":[23],"problems":[24,31,55,115],"on":[25,32,311],"restricted":[26],"inputs":[27],"(such":[28],"as":[29,43],"graph":[30],"planar":[33],"graphs),":[34],"most":[35],"such":[36,73,272],"rely":[38],"upon":[39],"encoding":[40],"the":[41,86,104,109,161,179,304,325,347],"instance":[42],"a":[44,57,124,136,141,145,165,175,227,242,263,292,296,332],"system":[45,125],"of":[46,88,98,126,160,167,205,214,222,239,261,270,280,307,334],"bounded-degree":[47,223],"equations.":[49],"In":[50,81,303],"particular,":[51,91],"satisfiability":[53],"(SAT)":[54],"with":[56,144,244,256],"fixed":[58],"constraint":[59,113,118],"language":[60,293,318],"\u0393,":[61],"every":[62,158],"previously":[63],"result":[65],"is":[66,76],"captured":[67],"by":[68,230,321],"this":[69,75,82,89],"approach;":[70],"several":[72],"problems,":[74],"to":[78,112,140,185],"be":[79,121,186],"tight.":[80],"work,":[83],"we":[84,154,210,218,252,313],"investigate":[85,268],"limits":[87],"approach\u2014in":[90],"does":[92,329],"it":[93],"really":[94],"cover":[95],"all":[96],"cases":[97,190],"sparsification?":[101],"We":[102,266,275],"generalize":[103],"method":[105],"using":[106,148],"tools":[107],"from":[108],"algebraic":[110],"approach":[111],"satisfaction":[114],"(CSP).":[116],"Every":[117],"that":[119,157,315],"can":[120,155,219],"modelled":[122,193],"via":[123,194],"linear":[127,176],"equations,":[128],"over":[129,197,236],"some":[130,198],"finite":[131,137,199],"field":[132],"F,":[133],"also":[134,267],"admits":[135,164],"domain":[138],"extension":[139,298],"tractable":[142],"CSP":[143],"Maltsev":[146,152,232,264,297],"polymorphism;":[147],"languages,":[153],"show":[156],"problem":[159,328],"latter":[162],"type":[163],"\u201cbasis\u201d":[166],"O":[168,245,336],"(":[169,246,337],"n":[170,247,338],")":[171,249,340],"constraints,":[172],"implies":[174],"sparsification":[177],"original":[180],"problem.":[181],"This":[182],"generalization":[183],"appears":[184],"strict;":[187],"other":[188],"special":[189],"include":[191],"constraints":[192,235],"group":[195,200],"equations":[196,225],"G":[201],".":[202],"For":[203],"sparsifications":[204],"but":[207],"super-linear":[208],"size,":[209],"consider":[211],"two":[212],"extensions":[213,233,255,273],"this.":[215],"Most":[216],"directly,":[217],"capture":[220],"systems":[221],"\u201clift-and-project\u201d":[228],"manner,":[229],"finding":[231],"c":[237,248],"-tuples":[238],"variables,":[240],"basis":[243],"constraints.":[250],"Additionally,":[251],"may":[253],"use":[254],"k":[257],"-edge":[258],"polymorphisms":[259,282],"instead":[260],"requiring":[262],"polymorphism.":[265],"characterizations":[269],"when":[271],"exist.":[274],"give":[276],"an":[277],"infinite":[278,301],"sequence":[279],"partial":[281],"\u03c6":[283,286,322],"1":[284,323],",":[285,288,324],"2":[287],"\u2026which":[289],"characterizes":[290],"whether":[291],"\u0393":[294],"has":[295],"(of":[299],"possibly":[300],"domain).":[302],"complementary":[305],"direction":[306],"proving":[308],"lower":[309],"bounds":[310],"kernelizability,":[312],"prove":[314],"any":[317,342],"not":[319,330],"preserved":[320],"corresponding":[326],"SAT":[327],"admit":[331],"kernel":[333],"size":[335],"2\u2212\u03b5":[339],"\u03b5":[343],">":[344],"0":[345],"unless":[346],"hierarchy":[349],"collapses.":[350]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}