{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T17:10:30Z","timestamp":1726852230701},"reference-count":10,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1587\/transinf.2021fcp0009","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T22:26:01Z","timestamp":1646087161000},"page":"481-490","source":"Crossref","is-referenced-by-count":0,"title":["An Improvement of the Biased-PPSZ Algorithm for the 3SAT Problem"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Tong","family":"QIN","sequence":"first","affiliation":[{"name":"SIT Division, Makino Milling Machine Co., Ltd."}]},{"given":"Osamu","family":"WATANABE","sequence":"additional","affiliation":[{"name":"School of Computing, Tokyo Institute of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Baumer and R. Schuler, \u201cImproving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs,\u201d Proc. 6th Int&apos;l Conference on Theory and Applications of Satisfiability Testing, LNCS, vol.2919, pp.150-161, 2003. 10.1007\/978-3-540-24605-3_12","DOI":"10.1007\/978-3-540-24605-3_12"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] T.D. Hansen, H. Kaplan, O. Zamir, and U. Zwick, \u201cFaster <i>k<\/i>-SAT algorithms using biased-PPSZ,\u201d Proc. 51st Annual ACM Sympos. on Theory of Computing, ACM Press, pp.578-589, 2019. 10.1145\/3313276.3316359","DOI":"10.1145\/3313276.3316359"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] T. Hertli, \u201cBreaking the PPSZ barrier for Unique 3-SAT,\u201d Proc. Int&apos;l Colloquium on Automata, Languages, and Programming, LNCS, vol.8572, pp.600-611, 2014. 10.1007\/978-3-662-43948-7_50","DOI":"10.1007\/978-3-662-43948-7_50"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] T. Hertli, \u201c3-SAT faster and simpler \u2014 Unique-SAT bounds for PPSZ hold in general,\u201d SIAM J. Comput., vol.43, no.2, pp.718-729, 2014. 10.1137\/120868177","DOI":"10.1137\/120868177"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] T. Hofmeister, U. Schoning, R. Schuler, and O. Watanabe, \u201cRandomized algorithms for 3-SAT,\u201d Theory of Computing Systems, vol.40, pp.249-262, 2007. 10.1007\/s00224-005-1275-6","DOI":"10.1007\/s00224-005-1275-6"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] R. Paturi, P. Pudl\u00e1k, M.E. Saks, and F. Zane, \u201cAn improved exponential-time algorithm for <i>k<\/i>-SAT,\u201d Journal of the ACM, vol.52, no.3, pp.337-364, 2005. 10.1145\/1066100.1066101","DOI":"10.1145\/1066100.1066101"},{"key":"7","unstructured":"[7] T. Qin, Doctoral Thesis, available by searching \u201cTong Qin\u201d at https:\/\/t2r2.star.titech.ac.jp\/index_en.html (from 2022)."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T. Qin and O. Watanabe, \u201cAn improvement of the algorithm of Hertli for the Unique 3SAT problem,\u201d Theoretical Computer Science, vol.806, pp.70-80, 2020. 10.1016\/j.tcs.2018.11.023","DOI":"10.1016\/j.tcs.2018.11.023"},{"key":"9","unstructured":"[9] D. Scheder and J.P. Steinberger, \u201cPPSZ for general <i>k<\/i>-SAT \u2014 Making Hertli&apos;s analysis simpler and 3-SAT faster,\u201d Proc. 32nd Computational Complexity Conference, 2017."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] O. Zamir, \u201cBreaking Barriers for the Satisfiability and Coloring Problems,\u201d PhD Thesis, Tel Aviv University, 2020. 10.15420\/aer.2018.21.2","DOI":"10.15420\/aer.2018.21.2"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021FCP0009\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T14:07:49Z","timestamp":1726754869000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021FCP0009\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2021fcp0009","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021FCP0009"}}