{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T01:53:52Z","timestamp":1770429232140,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00174-8","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"69-83","source":"Crossref","is-referenced-by-count":122,"title":["A deterministic (2\u22122\/(k+1))n algorithm for k-SAT based on local search"],"prefix":"10.1016","volume":"289","author":[{"given":"Evgeny","family":"Dantsin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Goerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward A","family":"Hirsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kannan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Kleinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Sch\u00f6ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00174-8_BIB1","series-title":"Information Theory","author":"Ash","year":"1965"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB2","series-title":"Search Methods for Artificial Intelligence","author":"Bolc","year":"1992"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB3","series-title":"Covering Codes","volume":"vol. 54","author":"Cohen","year":"1997"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB4","doi-asserted-by":"crossref","unstructured":"E. Dantsin, Two propositional proof systems based on the splitting method (in Russian). Zapiski Nauchnykh Seminarov LOM1, 105 (1981) 24\u201344 (English translation: Journal of Soviet Mathematics, 22(3) (1983) 1293\u20131305.)","DOI":"10.1007\/BF01084392"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB5","doi-asserted-by":"crossref","unstructured":"J. Gu, Q.-P. Gu, Average time complexity of the SAT 1.2 algorithm, in: D.-Z. Du, X.-S. Zhang (Eds.), Proc. Fifth Annu. Internat. Symp. Algorithms Comput., ISAAC\u201994, Lecture Notes in Computer Science, vol. 834, Springer, Berlin, 1994, pp. 146\u2013154.","DOI":"10.1007\/3-540-58325-4_176"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB6","series-title":"Algorithms for the Satisfiability Problem","author":"Gu","year":"2000"},{"issue":"4","key":"10.1016\/S0304-3975(01)00174-8_BIB7","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1023\/A:1006340920104","article-title":"New worst-case upper bounds for SAT","volume":"24","author":"Hirsch","year":"2000","journal-title":"J. Automat. Reason."},{"issue":"1\/2","key":"10.1016\/S0304-3975(01)00174-8_BIB8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1006318521185","article-title":"SAT local search algorithms: worst-case study","volume":"24","author":"Hirsch","year":"2000","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB9","series-title":"Approximation Algorithms for NP-hard Problems","author":"Hochbaum (Ed.)","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(01)00174-8_BIB10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(92)90029-U","article-title":"On the greedy algorithm for satisfiability","volume":"43","author":"Koutsoupias","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB11","series-title":"Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11\u201313, 1996)","first-page":"261","article-title":"Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms","volume":"vol. 35","author":"Kullmann","year":"1997"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00174-8_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(98)00017-6","article-title":"New methods for 3-SAT decision and worst-case analysis","volume":"223","author":"Kullmann","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB13","unstructured":"O. Kullmann, H. Luckhardt, Deciding propositional tautologies: Algorithms and their complexity, preprint, 82 pp. http:\/\/www.cs.toronto.edu\/\u223ckullmann, a journal version is submitted to Information and Computation, 1997."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems","volume":"58","author":"Minton","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","article-title":"Solving satisfiability in less than 2n steps","volume":"10","author":"Monien","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB16","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou, On selecting a satisfying truth assignment, in: Proc. 32nd Annu. IEEE Symp. on Foundations of Computer Science, FOCS\u201991, 1991, pp. 163\u2013169.","DOI":"10.1109\/SFCS.1991.185365"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB17","doi-asserted-by":"crossref","unstructured":"R. Paturi, P. Pudl\u00e1k, M.E. Saks, F. Zane, An improved exponential-time algorithm for k-SAT, in: Proc. 39th Annu. IEEE Symp. on Foundations of Computer Science, FOCS\u201998, 1998, pp. 628\u2013637.","DOI":"10.1109\/SFCS.1998.743513"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB18","doi-asserted-by":"crossref","unstructured":"R. Paturi, P. Pudl\u00e1k, F. Zane, Satisfiability coding lemma, in: Proc. 38th Annu. IEEE Symp. on Foundations of Computer Science, FOCS\u201997, 1997, pp. 566\u2013574.","DOI":"10.1109\/SFCS.1997.646146"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB19","unstructured":"I. Schiermeyer, Pure literal look ahead: An O(1, 497n) 3-satisfiability algorithm, Workshop on the Satisfiability Problem, Siena, April 29\u2013May 3, 1996, Technical Report 96-230, University K\u00f6ln, 1996."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB20","doi-asserted-by":"crossref","unstructured":"U. Sch\u00f6ning, A probabilistic algorithm for k-SAT and constraint satisfaction problems, in: Proc. 40th Annu. IEEE Symp. on Foundations of Computer Science, FOCS\u201999, 1999, pp. 410\u2013414.","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB21","unstructured":"R. Schuler, U. Sch\u00f6ning, O. Watanabe, An improved randomized algorithm for 3-SAT, Dept. Math. Comput. Sci., Tokyo Inst. of Tech., 2001, TR-C146."},{"key":"10.1016\/S0304-3975(01)00174-8_BIB22","series-title":"Proc. Tenth National Conf. Artif. Intell. AAAI-92","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/S0304-3975(01)00174-8_BIB23","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(95)00144-1","article-title":"Number of models and satisfiability of sets of clauses","volume":"155","author":"Zhang","year":"1996","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001748?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001748?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:22:42Z","timestamp":1554772962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501001748"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00174-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}