{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:40:33Z","timestamp":1739187633007,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_10","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"80-85","source":"Crossref","is-referenced-by-count":1,"title":["Solving SAT for\u00a0CNF Formulas with a One-Sided Restriction on Variable Occurrences"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Johannsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Razgon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Wahlstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms\u00a02(2), 153\u2013177 (2006)","journal-title":"ACM Trans. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for SAT. In: Annual IEEE Conference on Computational Complexity, pp. 252\u2013260 (2006)","key":"10_CR2","DOI":"10.1109\/CCC.2006.6"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E. Dantsin","year":"2002","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J.M., Papadimitriou, C.H., Raghavan, P., Sch\u00f6ning, U.: A deterministic (2\u2009\u2212\u20092\/(k\u2009+\u20091)) n algorithm for k-SAT based on local search. Theoretical Computer Science\u00a0289(1), 69\u201383 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/1066100.1066101","volume":"52","author":"R. Paturi","year":"2005","unstructured":"Paturi, R., Pudl\u00e1k, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for k-sat. J. ACM\u00a052(3), 337\u2013364 (2005)","journal-title":"J. ACM"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/TPAMI.1984.4767555","volume":"6","author":"P.W. Purdom","year":"1984","unstructured":"Purdom, P.W.: Solving satisfiability with less searching. IEEE Trans. Pattern Anal. Machine Intell.\u00a06(4), 510\u2013513 (1984)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11561071_12","volume-title":"Algorithms \u2013 ESA 2005","author":"M. Wahlstr\u00f6m","year":"2005","unstructured":"Wahlstr\u00f6m, M.: An algorithm for the SAT problem for formulae of linear length. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 107\u2013118. Springer, Heidelberg (2005)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/11499107_23","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Wahlstr\u00f6m","year":"2005","unstructured":"Wahlstr\u00f6m, M.: Faster exact solving of SAT formulae with a low number of occurrences per variable. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 309\u2013323. Springer, Heidelberg (2005)"},{"issue":"2","key":"10_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/00150517.1998.12428948","volume":"36","author":"D. Wolfram","year":"1998","unstructured":"Wolfram, D.: Solving generalized Fibonacci recurrences. The Fibonacci Quarterly\u00a036(2), 129\u2013145 (1998)","journal-title":"The Fibonacci Quarterly"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:13:22Z","timestamp":1739186002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}