{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:08:23Z","timestamp":1762099703575},"reference-count":11,"publisher":"Elsevier BV","issue":"3-5","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0167-6377(98)00052-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"81-88","source":"Crossref","is-referenced-by-count":26,"title":["A two-phase algorithm for solving a class of hard satisfiability problems"],"prefix":"10.1016","volume":"23","author":[{"given":"Joost P.","family":"Warners","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00052-2_BIB1","unstructured":"GT6 algorithm solves the extended DIMACS 32-bit parity problem. Note available from http:\/\/www.research.att.com\/\u00a0\u0303kautz\/challenge\/, 1998."},{"key":"10.1016\/S0167-6377(98)00052-2_BIB2","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem proving procedures, in: Proc. 3rd Ann. ACM Symp. on the Theory of Computing, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S0167-6377(98)00052-2_BIB3","unstructured":"J.M. Crawford, M.J. Kearns, R.E. Schapire, The minimal disagreement parity problem as a hard satisfiability problem, Draft version, 1995."},{"key":"10.1016\/S0167-6377(98)00052-2_BIB4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-6377(98)00052-2_BIB5","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/S0167-6377(98)00052-2_BIB6","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/69.334864","article-title":"Global optimization for satisfiability (SAT) problem","volume":"6","author":"Gu","year":"1994","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/S0167-6377(98)00052-2_BIB7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-6377(98)00052-2_BIB8","doi-asserted-by":"crossref","unstructured":"T.J. Schaefer, The complexity of satisfiability problems, Proc. 10th Symp. on the Theory of Computing, 1978, pp. 216\u2013226.","DOI":"10.1145\/800133.804350"},{"key":"10.1016\/S0167-6377(98)00052-2_BIB9","unstructured":"B. Selman, H. Kautz, D. McAllester, Ten challenges in propositional reasoning and search, Proc.15th Int. Joint Conf. on Artificial Intelligence, IJCAI-97, Nagoya, Aichi, Japan, 1997."},{"key":"10.1016\/S0167-6377(98)00052-2_BIB10","doi-asserted-by":"crossref","unstructured":"M.A. Trick, Second DIMACS challenge test problems, in; D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS implementation challenge, vol. 26 of DIMACS series in Discrete Mathematics and Computer Science, American Mathematical Society, 1996, Providence, RI, pp. 653\u2013657.","DOI":"10.1090\/dimacs\/026\/01"},{"key":"10.1016\/S0167-6377(98)00052-2_BIB11","doi-asserted-by":"crossref","unstructured":"J.P. Warners, H. Van Maaren, Recognition of tractable satisfiability problems through balanced polynomial representations, Discrete Appl. Math., accepted for publication.","DOI":"10.1016\/S0166-218X(99)00135-3"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000522?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000522?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:54:44Z","timestamp":1555577684000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":11,"journal-issue":{"issue":"3-5","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0167637798000522"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00052-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}