{"id":"https://openalex.org/W3005294169","doi":"https://doi.org/10.1145/3624704","title":"Optimal Polynomial-Time Compression for Boolean Max CSP","display_name":"Optimal Polynomial-Time Compression for Boolean Max CSP","publication_year":2023,"publication_date":"2023-09-26","ids":{"openalex":"https://openalex.org/W3005294169","doi":"https://doi.org/10.1145/3624704","mag":"3005294169"},"language":"en","primary_location":{"id":"doi:10.1145/3624704","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3624704","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3624704","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3624704","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103139616","display_name":"Micha\u0142 W\u0142odarczyk","orcid":"https://orcid.org/0000-0003-0968-8414"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 W\u0142odarczyk","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048942396"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.3924,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60692356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"16","issue":"1","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/mathematics","display_name":"Mathematics","score":0.7273086309432983},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6692400574684143},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6511256694793701},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.5985033512115479},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5904948711395264},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5393106937408447},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5331945419311523},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4370861053466797},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41263484954833984}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7273086309432983},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6692400574684143},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6511256694793701},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.5985033512115479},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5904948711395264},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5393106937408447},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5331945419311523},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4370861053466797},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41263484954833984},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3624704","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3624704","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3624704","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/18b9f8a4-8a4c-43f7-863d-dfa61e727be1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/18b9f8a4-8a4c-43f7-863d-dfa61e727be1","pdf_url":"https://pure.tue.nl/ws/files/347237483/3624704.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jansen, B M P & Wlodarczyk, M 2024, 'Optimal Polynomial-Time Compression for Boolean Max CSP', ACM Transactions on Computation Theory, vol. 16, no. 1, 4. https://doi.org/10.1145/3624704","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/18b9f8a4-8a4c-43f7-863d-dfa61e727be1","is_oa":true,"landing_page_url":"https://research.tue.nl/files/347237483/3624704.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jansen, B M P & Wlodarczyk, M 2024, 'Optimal Polynomial-Time Compression for Boolean Max CSP', ACM Transactions on Computation Theory, vol. 16, no. 1, 4. https://doi.org/10.1145/3624704","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3624704","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3624704","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3624704","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8368575583","display_name":"Rigorous Search Space Reduction","funder_award_id":"803421","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3005294169.pdf","grobid_xml":"https://content.openalex.org/works/W3005294169.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W1542212162","https://openalex.org/W1571873445","https://openalex.org/W1909439116","https://openalex.org/W1969865855","https://openalex.org/W1979388565","https://openalex.org/W1986602165","https://openalex.org/W2034437384","https://openalex.org/W2054996571","https://openalex.org/W2068190866","https://openalex.org/W2073107304","https://openalex.org/W2076058038","https://openalex.org/W2117290960","https://openalex.org/W2118728198","https://openalex.org/W2136083928","https://openalex.org/W2142884756","https://openalex.org/W2147154704","https://openalex.org/W2253657605","https://openalex.org/W2591931678","https://openalex.org/W2593968481","https://openalex.org/W2626596188","https://openalex.org/W2659011796","https://openalex.org/W2909144890","https://openalex.org/W2962785950","https://openalex.org/W2962988009","https://openalex.org/W2963025941","https://openalex.org/W2963768895","https://openalex.org/W2963798801","https://openalex.org/W2965422163","https://openalex.org/W2972131259","https://openalex.org/W3000512743","https://openalex.org/W3004402411","https://openalex.org/W3023177507","https://openalex.org/W3081785465","https://openalex.org/W3137355438","https://openalex.org/W3193618752","https://openalex.org/W4211121212"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W2425261484","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004"],"abstract_inverted_index":{"In":[0],"the":[1,32,40,44,64,79,83,98,110,189,197,230],"Boolean":[2,37],"maximum":[3],"constraint":[4,22],"satisfaction":[5],"problem\u2014":[6],"Max":[7,93,106,136,157,217,240,251],"CSP\u0393":[8,94,107,137,158,218],"\u2014one":[9],"is":[10,34,50,115,243],"given":[11],"a":[12,20,26,54,59,89,163,226],"collection":[13],"of":[14,17,29,47,85,92,112,135,191,199,204,229,239],"weighted":[15],"applications":[16],"constraints":[18,49,183],"from":[19],"finite":[21],"language":[23],"\u0393,":[24,129],"over":[25],"common":[27],"set":[28],"variables,":[30],"and":[31,70,87],"goal":[33],"to":[35,39,66,97,165],"assign":[36],"values":[38],"variables":[41,113],"so":[42],"that":[43,72,105,224],"total":[45],"weight":[46],"satisfied":[48],"maximized.":[51],"There":[52],"exists":[53,121],"concise":[55],"dichotomy":[56],"theorem":[57],"providing":[58],"criterion":[60],"on":[61,128,181],"\u0393":[62],"for":[63,215,236,250,254],"problem":[65],"be":[67,139],"polynomial-time":[68,117],"solvable":[69],"stating":[71],"otherwise,":[73],"it":[74],"becomes":[75],"NP-hard.":[76],"We":[77],"study":[78],"NP-hard":[80],"cases":[81],"through":[82],"lens":[84],"kernelization":[86],"provide":[88],"complete":[90],"characterization":[91],"with":[95,145,188],"respect":[96],"optimal":[99,212],"compression":[100,164],"size.":[101],"Namely,":[102],"we":[103,207,222],"prove":[104],"parameterized":[108],"by":[109],"number":[111],"n":[114,147,150,167,234],"either":[116],"solvable,":[118],"or":[119],"there":[120],"an":[122,142],"integer":[123],"d":[124,148,252,256],"\u2265":[125],"2":[126],"depending":[127],"such":[130,162],"that:":[131],"(1)":[132],"An":[133],"instance":[134,144],"can":[138],"compressed":[140],"into":[141],"equivalent":[143],"\ud835\udcaa(":[146,166],"log":[149],")":[151,169,235],"bits":[152,170],"in":[153,196],"polynomial":[154],"time,":[155],"(2)":[156],"does":[159],"not":[160],"admit":[161],"d-\u03b5":[168],"unless":[171],"NP":[172],"\u2286":[173],"co-NP":[174],"/":[175],"poly.":[176],"Our":[177],"reductions":[178],"are":[179],"based":[180],"interpreting":[182],"as":[184,244,246],"multilinear":[185],"polynomials":[186],"combined":[187],"framework":[190],"\u201cconstraint":[192],"implementations\u201d,":[193],"formerly":[194],"used":[195],"context":[198],"APX-hardness.":[200],"As":[201],"another":[202],"application":[203],"our":[205],"reductions,":[206],"reveal":[208],"tight":[209],"connections":[210],"between":[211],"running":[213,227],"times":[214],"solving":[216],".":[219,257],"More":[220],"precisely,":[221],"show":[223],"obtaining":[225],"time":[228],"form":[231],"\ud835\udcaa(2":[232],"(1-\u03b5)":[233],"particular":[237],"classes":[238],"CSP":[241],"s":[242],"hard":[245],"breaching":[247],"this":[248],"barrier":[249],"-SAT":[253],"some":[255]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}