{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:06:03Z","timestamp":1760609163508,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1841\/14"],"award-info":[{"award-number":["1841\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"German-Israeli Foundation for Scientific Research and Development","award":["1367\/2017"],"award-info":[{"award-number":["1367\/2017"]}]},{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["16582"],"award-info":[{"award-number":["16582"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011643","name":"Blavatnik Family Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011643","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316359","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"578-589","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Faster\n            <i>k<\/i>\n            -SAT algorithms using biased-PPSZ"],"prefix":"10.1145","author":[{"given":"Thomas Dueholm","family":"Hansen","sequence":"first","affiliation":[{"name":"University of Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Or","family":"Zamir","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Spencer","author":"Alon Noga","year":"2016","unstructured":"Noga Alon and Joel H . Spencer . 2016 . Noga Alon and Joel H. Spencer. 2016."},{"edition":"4","volume-title":"The probabilistic method","key":"e_1_3_2_1_2_1","unstructured":"The probabilistic method ( 4 nd ed.). Wiley-Interscience . The probabilistic method (4nd ed.). Wiley-Interscience."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/120868177"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_50"},{"key":"e_1_3_2_1_6_1","unstructured":"Thomas Hofmeister Uwe Sch\u00f6ning Rainer Schuler and Osamu Watanabe. 2007.  Thomas Hofmeister Uwe Sch\u00f6ning Rainer Schuler and Osamu Watanabe. 2007."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1275-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"volume-title":"Complexity of computer computations","author":"Karp Richard M","key":"e_1_3_2_1_9_1","unstructured":"Richard M Karp . 1972. Reducibility among combinatorial problems . In Complexity of computer computations . Springer , 85\u2013103. Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85\u2013103."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90050-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066101"},{"key":"e_1_3_2_1_12_1","unstructured":"Ramamohan Paturi Pavel Pudl\u00e1k and Francis Zane. 1999. Satisfiability Coding Lemma. Chicago J. Theor. Comput. Sci. (1999). http:\/\/cjtcs.cs.uchicago.edu\/ articles\/1999\/11\/contents.html  Ramamohan Paturi Pavel Pudl\u00e1k and Francis Zane. 1999. Satisfiability Coding Lemma. Chicago J. Theor. Comput. Sci. (1999). http:\/\/cjtcs.cs.uchicago.edu\/ articles\/1999\/11\/contents.html"},{"key":"e_1_3_2_1_13_1","unstructured":"Pavel Pudl\u00e1k Dominik Scheder and Navid Talebanfard. 2017.  Pavel Pudl\u00e1k Dominik Scheder and Navid Talebanfard. 2017."},{"key":"e_1_3_2_1_14_1","volume-title":"Hard Instances for PPSZ. In Proc. of 44th ICALP (Leibniz International Proceedings in Informatics (LIPIcs)), Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl (Eds.)","volume":"80","author":"Tighter","unstructured":"Tighter Hard Instances for PPSZ. In Proc. of 44th ICALP (Leibniz International Proceedings in Informatics (LIPIcs)), Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl (Eds.) , Vol. 80 . Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 85:1\u201385:13. Tighter Hard Instances for PPSZ. In Proc. of 44th ICALP (Leibniz International Proceedings in Informatics (LIPIcs)), Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl (Eds.), Vol. 80. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 85:1\u201385:13."},{"key":"e_1_3_2_1_15_1","unstructured":"Tong Qin and Osamu Watanabe. 2018.  Tong Qin and Osamu Watanabe. 2018."},{"volume-title":"International Workshop on Algorithms and Computation. Springer, 93\u2013105","author":"An","key":"e_1_3_2_1_16_1","unstructured":"An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem . In International Workshop on Algorithms and Computation. Springer, 93\u2013105 . An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem. In International Workshop on Algorithms and Computation. Springer, 93\u2013105."},{"key":"e_1_3_2_1_17_1","volume-title":"International Conference AISMC-3","author":"Rodo\u0161ek Robert","year":"1996","unstructured":"Robert Rodo\u0161ek . 1996 . A New Approach on Solving 3-Satisfiability. In Artificial Intelligence and Symbolic Mathematical Computation , International Conference AISMC-3 , Steyr, Austria , September 23-25, 1996, Proceedings. 197\u2013212. 540- 61732- 9_59 Robert Rodo\u0161ek. 1996. A New Approach on Solving 3-Satisfiability. In Artificial Intelligence and Symbolic Mathematical Computation, International Conference AISMC-3, Steyr, Austria, September 23-25, 1996, Proceedings. 197\u2013212. 540- 61732- 9_59"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_16"},{"key":"e_1_3_2_1_19_1","volume-title":"Faster. In 32nd Computational Complexity Conference, CCC 2017","author":"Scheder Dominik","year":"2017","unstructured":"Dominik Scheder and John P. Steinberger . 2017. PPSZ for General k-SAT - Making Hertli\u2019s Analysis Simpler and 3-SAT Faster. In 32nd Computational Complexity Conference, CCC 2017 , July 6-9, 2017 , Riga, Latvia. 9:1\u20139:15. 4230\/LIPIcs.CCC. 2017.9 Dominik Scheder and John P. Steinberger. 2017. PPSZ for General k-SAT - Making Hertli\u2019s Analysis Simpler and 3-SAT Faster. In 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia. 9:1\u20139:15. 4230\/LIPIcs.CCC.2017.9"},{"key":"e_1_3_2_1_20_1","unstructured":"Uwe Sch\u00f6ning. 2002.  Uwe Sch\u00f6ning. 2002."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0094-7"},{"key":"e_1_3_2_1_22_1","unstructured":"Magnus Wahlstr\u00f6m. 2005.  Magnus Wahlstr\u00f6m. 2005."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Phoenix AZ USA","acronym":"STOC '19"},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316359","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":22,"alternative-id":["10.1145\/3313276.3316359","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316359","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}