{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:31Z","timestamp":1725558931524},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141850"},{"type":"electronic","value":"9783642141867"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14186-7_15","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T22:20:37Z","timestamp":1278627637000},"page":"172-180","source":"Crossref","is-referenced-by-count":0,"title":["An Exact Algorithm for the Boolean Connectivity Problem for k-CNF"],"prefix":"10.1007","author":[{"given":"Kazuhisa","family":"Makino","sequence":"first","affiliation":[]},{"given":"Suguru","family":"Tamaki","sequence":"additional","affiliation":[]},{"given":"Masaki","family":"Yamamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R. Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. Journal of the ACM\u00a09(1), 61\u201363 (1962)","journal-title":"Journal of the ACM"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-70575-8_17","volume-title":"Automata, Languages and Programming","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 198\u2013209. Springer, Heidelberg (2008)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Proc. STOC 2007, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion-exclusion algorithms for counting set partitions. In: Proc.\u00a0FOCS 2006, pp. 575\u2013582 (2006)","DOI":"10.1109\/FOCS.2006.41"},{"key":"15_CR5","unstructured":"Calabro, C.: The exponential complexity of satisfiability problems, Ph.D. thesis, University of California, San Diego (2009)"},{"issue":"6","key":"15_CR6","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1137\/07070440X","volume":"38","author":"P. Gopalan","year":"2009","unstructured":"Gopalan, P., Kolaitis, P.G., Maneva, E.N., Papadimitriou, C.H.: The connectivity of Boolean satisfiability: Computational and structural dichotomies. SIAM J.\u00a0Comput.\u00a038(6), 2330\u20132355 (2009)","journal-title":"SIAM J.\u00a0Comput."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Operations Res.\u00a018, 1138\u20131162 (1970)","journal-title":"Operations Res."},{"key":"15_CR8","unstructured":"Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proc.\u00a0SODA 2004, pp. 328\u2013329 (2004)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An O(2 n ) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proc. FOCS 2006, pp. 583\u2013590 (2006)","DOI":"10.1109\/FOCS.2006.11"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2007.06.017","volume":"105","author":"K. Kutzkov","year":"2007","unstructured":"Kutzkov, K.: New upper bound for the #3-SAT problem. Inf.\u00a0Process.\u00a0Lett.\u00a0105(1), 1\u20135 (2007)","journal-title":"Inf.\u00a0Process.\u00a0Lett."},{"key":"15_CR11","doi-asserted-by":"publisher","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 Applied Mathematics\u00a010, 287\u2013295 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-72788-0_20","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"K. Makino","year":"2007","unstructured":"Makino, K., Tamaki, S., Yamamoto, M.: On the Boolean connectivity problem for Horn relations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 187\u2013200. Springer, Heidelberg (2007)"},{"issue":"3","key":"15_CR13","first-page":"337","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.\u00a0ACM\u00a052(3), 337\u2013364 (2005)","journal-title":"J.\u00a0ACM"},{"key":"15_CR14","unstructured":"Paturi, R., Pudl\u00e1k, P., Zane, F.: Satisfiability coding lemma. Chicago J.\u00a0Theor.\u00a0Comput.\u00a0Sci. (1999)"},{"key":"15_CR15","first-page":"111","volume":"1","author":"D. Rolf","year":"2006","unstructured":"Rolf, D.: Improved bound for the PPSZ\/Sch\u00f6ning-algorithm for 3-SAT. JSAT\u00a01, 111\u2013122 (2006)","journal-title":"JSAT"},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00453-001-0094-7","volume":"32","author":"U. Sch\u00f6ning","year":"2002","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica\u00a032(4), 615\u2013623 (2002)","journal-title":"Algorithmica"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-31856-9_3","volume-title":"STACS 2005","author":"U. Sch\u00f6ning","year":"2005","unstructured":"Sch\u00f6ning, U.: Algorithmics in exponential time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 36\u201343. Springer, Heidelberg (2005)"},{"key":"15_CR18","unstructured":"Williams, R.: Algorithms for quantified Boolean formulas. In: Proc.\u00a0SODA 2002, pp. 299\u2013307 (2002)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/978-3-540-27836-8_101","volume-title":"Automata, Languages and Programming","author":"R. Williams","year":"2004","unstructured":"Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1227\u20131237. Springer, Heidelberg (2004)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: Exact algorithms for NP-hard problems: a survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14186-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:31:24Z","timestamp":1559255484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14186-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141850","9783642141867"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14186-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}