{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:29:14Z","timestamp":1649100554252},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,10]],"date-time":"2012-02-10T00:00:00Z","timestamp":1328832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00224-012-9383-6","type":"journal-article","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T13:12:06Z","timestamp":1328793126000},"page":"271-284","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Analysis for the Critical Clause Tree"],"prefix":"10.1007","volume":"52","author":[{"given":"Masaki","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,10]]},"reference":[{"key":"9383_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/FOCS.2011.22","volume-title":"Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS2011)","author":"T. Hertli","year":"2011","unstructured":"Hertli, T.: 3-SAT faster and simpler\u2014unique-SAT bounds for PPSZ hold in general. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS2011), pp.\u00a0277\u2013284 (2011)"},{"issue":"2","key":"9383_CR2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF03024089","volume":"13","author":"P. Hilton","year":"1991","unstructured":"Hilton, P., Pedersen, J.: Catalan numbers, their generalization, and their uses. Math. Intell. 13(2), 64\u201375 (1991)","journal-title":"Math. Intell."},{"key":"9383_CR3","first-page":"328","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA04)","author":"K. Iwama","year":"2004","unstructured":"Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA04), p.\u00a0328 (2004)"},{"key":"9383_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","volume":"10","author":"B. Monien","year":"1985","unstructured":"Monien, B., Speckenmeyer, E.: Solving satisfiability in less than 2 n steps. Discrete Appl. Math. 10, 287\u2013295 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9383_CR5","first-page":"245","volume-title":"Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC2011)","author":"R. Moser","year":"2011","unstructured":"Moser, R., Scheder, D.: A full derandomization of Sch\u00f6ning k-SAT algorithm. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC2011), pp.\u00a0245\u2013252 (2011)"},{"key":"9383_CR6","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/SFCS.1997.646146","volume-title":"Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS1997)","author":"R. Paturi","year":"1997","unstructured":"Paturi, R., Pudl\u00e1k, P., Zane, F.: Satisfiability coding lemma. In: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS1997), pp.\u00a0566\u2013574 (1997)"},{"key":"9383_CR7","first-page":"628","volume-title":"Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS1998)","author":"R. Paturi","year":"1998","unstructured":"Paturi, R., Pudl\u00e1k, P., Saks, M., Zane, F.: An improved exponential-time algorithm for k-SAT. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS1998), pp.\u00a0628\u2013637 (1998). (This is the preliminary version of J. ACM 52(3), 337\u2013364 (2005))"},{"key":"9383_CR8","first-page":"410","volume-title":"Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS1999)","author":"U. Sch\u00f6ning","year":"1999","unstructured":"Sch\u00f6ning, U.: A\u00a0probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS1999), pp.\u00a0410\u2013414 (1999)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9383-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9383-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9383-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:23Z","timestamp":1558698863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9383-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9383"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9383-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,10]]}}}