{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:44:49Z","timestamp":1725846289491},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279251"},{"type":"electronic","value":"9783319279268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27926-8_23","type":"book-chapter","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T05:31:17Z","timestamp":1451971877000},"page":"257-268","source":"Crossref","is-referenced-by-count":1,"title":["Characterization of the $$\\#k$$ # k \u2013SAT Problem in Terms of Connected Components"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Nicosia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piero","family":"Conca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,6]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-15396-9_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"S Ermon","year":"2010","unstructured":"Ermon, S., Gomes, C.P., Selman, B.: Computing the density of states of boolean formulas. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 38\u201352. Springer, Heidelberg (2010)"},{"key":"23_CR2","unstructured":"Ermon, S., Gomes, C., Selman, B.: A flat histogram method for computing the density of states of combinatorial problems. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp. 2608\u20132613 (2011)"},{"key":"23_CR3","unstructured":"Montanari, A., Shah, D.: Counting good truth assignments of random k-SAT formulae. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201907, pp. 1255\u20131264 (2007)"},{"key":"23_CR4","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: AAAI, vol. 92, pp. 459\u2013465 (1992)"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00044-5","volume":"81","author":"T Hogg","year":"1996","unstructured":"Hogg, T., Huberman, B.A., Williams, C.P.: Phase transitions and the search problem. Artif. Intell. 81(1), 1\u201315 (1996)","journal-title":"Artif. Intell."},{"issue":"1","key":"23_CR6","first-page":"3","volume":"265","author":"R Monasson","year":"2001","unstructured":"Monasson, R., Martin, O., Zecchina, R.: Statistical mechanics methods and phase transitions in optimizations problems. Theor. Comput. Sci. 265(1), 3\u201367 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"6740","key":"23_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic phase transitions. Nature 400(6740), 133\u2013137 (1999)","journal-title":"Nature"},{"issue":"5582","key":"23_CR8","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1126\/science.1073287","volume":"297","author":"M M\u00e9zard","year":"2002","unstructured":"M\u00e9zard, M., Parisi, G., Zecchina, R.: Analytic and algorithmic solution of random satisfiability problems. Science 297(5582), 812\u2013815 (2002)","journal-title":"Science"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1287\/ijoc.2014.0633","volume":"27","author":"R Vaisman","year":"2015","unstructured":"Vaisman, R., Strichman, O., Gertsbakh, I.: Model counting of monotone conjunctive normal form formulas with spectr. NFORMS J. Comput. 27(2), 406\u2013415 (2015)","journal-title":"NFORMS J. Comput."},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1613\/jair.601","volume":"10","author":"E Birnbaum","year":"1999","unstructured":"Birnbaum, E., Lozinskii, E.L.: The good old Davis-Putnam procedure helps counting models. J. Artif. Intell. Res. 10, 457\u2013477 (1999)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(91)90315-S","volume":"81","author":"O Dubois","year":"1991","unstructured":"Dubois, O.: Counting the number of solutions for instances of satisfiability. Theor. Comput. Sci. 81(1), 49\u201364 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(95)00144-1","volume":"155","author":"W Zhang","year":"1996","unstructured":"Zhang, W.: Number of models and satisfiability of sets of clauses. Theor. Comput. Sci. 155(1), 277\u2013288 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR13","unstructured":"Littman, M.L., Pitassi, T., Impagliazzo, R.: On the complexity of counting satisfying assignments. Unpublished manuscript, vol. 328, p. 329 (2001)"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(95)00184-0","volume":"215","author":"Y Boufkhad","year":"1999","unstructured":"Boufkhad, Y., Dubois, O.: Length of prime implicants and number of solutions of random CNF formulae. Theor. Comput. Sci. 215(1), 1\u201330 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR15","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W.H. Freeman, New York (2002)"},{"key":"23_CR16","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2003","unstructured":"Papadimitriou, C.H.: Computational Complexity. John Wiley and Sons Ltd., Chichester (2003)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27926-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T22:59:13Z","timestamp":1548025153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27926-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279251","9783319279268"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27926-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}