{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:51:00Z","timestamp":1767923460571,"version":"3.49.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T00:00:00Z","timestamp":1567209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NWO Veni grant \u201dFrontiers in Parameterized Preprocessing\u201e","award":["639.021.437"],"award-info":[{"award-number":["639.021.437"]}]},{"name":"NWO Gravitation grant \u201dNetworks\u201e","award":["024.002.003"],"award-info":[{"award-number":["024.002.003"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Theory"],"published-print":{"date-parts":[[2019,12,31]]},"abstract":"<jats:p>\n            This article analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP \u2288 coNP\/poly, no efficient preprocessing algorithm can reduce\n            <jats:italic>n<\/jats:italic>\n            -variable instances of\n            <jats:sc>cnf-sat<\/jats:sc>\n            with\u00a0\n            <jats:italic>d<\/jats:italic>\n            literals per clause to equivalent instances with\u00a0\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\n              <jats:italic>d<\/jats:italic>\n              \u2212\u03b5\n            <\/jats:sup>\n            ) bits for any\u00a0\u03b5 &gt; 0. For the N\n            <jats:sc>ot<\/jats:sc>\n            -A\n            <jats:sc>ll<\/jats:sc>\n            -E\n            <jats:sc>qual sat<\/jats:sc>\n            problem, a compression to size\u00a0\n            <jats:italic>\u00d5<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\n              <jats:italic>d<\/jats:italic>\n              \u22121\n            <\/jats:sup>\n            ) exists. We put these results in a common framework by analyzing the compressibility of CSPs with a binary domain. We characterize constraint types based on the minimum degree of multivariate polynomials whose roots correspond to the satisfying assignments, obtaining (nearly) matching upper and lower bounds in several settings. Our lower bounds show that not just the number of constraints, but also the encoding size of individual constraints plays an important role. For example, for E\n            <jats:sc>xact<\/jats:sc>\n            S\n            <jats:sc>atisfiability<\/jats:sc>\n            with unbounded clause length it is possible to efficiently reduce the number of constraints to\u00a0\n            <jats:italic>n<\/jats:italic>\n            +1, yet no polynomial-time algorithm can reduce to an equivalent instance with\u00a0\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2\u2212\u03b5<\/jats:sup>\n            ) bits for any\u00a0 \u03b5 &gt; 0, unless NP \u2286 coNP\/poly.\n          <\/jats:p>","DOI":"10.1145\/3349618","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T12:47:00Z","timestamp":1567514820000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials"],"prefix":"10.1145","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8204-1268","authenticated-orcid":false,"given":"Bart M. P.","family":"Jansen","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3721-6721","authenticated-orcid":false,"given":"Astrid","family":"Pieterse","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/167687.167724"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263424"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336538"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 30th CCC (LIPIcs)","volume":"33","author":"Bhowmick Abhishek","year":"2015"},{"key":"e_1_2_1_5_1","volume-title":"Encyclopedia of Algorithms","author":"Bodlaender Hans L."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/120880240"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.039"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/120882160"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 13th IPEC","volume":"115","author":"Chen Hubie","year":"2019"},{"key":"e_1_2_1_10_1","volume-title":"Parameterized Algorithms","author":"Cygan Marek"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 10th IPEC (LIPIcs)","volume":"43","author":"Dell Holger","year":"2015"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095122"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629620"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_32"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2650261"},{"key":"e_1_2_1_16_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2013"},{"key":"e_1_2_1_17_1","unstructured":"J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer-Verlag.   J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer-Verlag."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.007"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2008.167.481"},{"key":"e_1_2_1_20_1","volume-title":"Kernelization: Constraint satisfaction problems parameterized above average. In Encyclopedia of Algorithms, Ming-Yang Kao (Ed.)","author":"Gutin Gregory","year":"2015"},{"key":"e_1_2_1_21_1","volume-title":"Handbook of Linear Algebra","author":"Hogben Leslie"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081088608817705"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9924-2"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 33rd STACS (LIPIcs)","volume":"47","author":"Jansen Bart M. P.","year":"2016"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0189-9"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 12th IPEC","volume":"89","author":"Bart M.","year":"2017"},{"key":"e_1_2_1_28_1","volume-title":"Complexity of Computer Computations","author":"Karp R. M."},{"key":"e_1_2_1_29_1","first-page":"58","article-title":"Recent developments in kernelization: A survey","volume":"113","author":"Kratsch Stefan","year":"2014","journal-title":"Bull. EATCS"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858787"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880989"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66158-2_11"},{"key":"e_1_2_1_33_1","volume-title":"Fellows on the Occasion of His 60th Birthday (Lecture Notes in Computer Science)","volume":"7370","author":"Lokshtanov Daniel","year":"2012"},{"key":"e_1_2_1_34_1","unstructured":"L\u00e1sl\u00f3 Lov\u00e1sz. 1976. Chromatic number of hypergraphs and linear algebra. In Studia Scientiarum Mathematicarum Hungarica 11. 113--114. Retrieved from: http:\/\/real-j.mtak.hu\/5461\/.  L\u00e1sl\u00f3 Lov\u00e1sz. 1976. Chromatic number of hypergraphs and linear algebra. In Studia Scientiarum Mathematicarum Hungarica 11. 113--114. Retrieved from: http:\/\/real-j.mtak.hu\/5461\/."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_65"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","volume-title":"Fast Algorithms for Linear Algebra Modulo N","author":"Storjohann Arne","DOI":"10.1007\/3-540-68530-8_12"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001597"}],"container-title":["ACM Transactions on Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3349618","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3349618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:19Z","timestamp":1750202599000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3349618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,31]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12,31]]}},"alternative-id":["10.1145\/3349618"],"URL":"https:\/\/doi.org\/10.1145\/3349618","relation":{},"ISSN":["1942-3454","1942-3462"],"issn-type":[{"value":"1942-3454","type":"print"},{"value":"1942-3462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,31]]},"assertion":[{"value":"2017-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}