{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:45:25Z","timestamp":1725453925667},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311482"},{"type":"electronic","value":"9783642311499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31149-9_28","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T15:44:47Z","timestamp":1340811887000},"page":"273-282","source":"Crossref","is-referenced-by-count":1,"title":["Computing #2SAT and #2UNSAT by Binary Patterns"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"De Ita Luna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Raymundo","family":"Marcial-Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2004.10.037","volume":"332","author":"V. Dahll\u00f6f","year":"2005","unstructured":"Dahll\u00f6f, V., Jonsson, P., Wahlstr\u00f6m, M.: Counting models for 2SAT and 3SAT formulae. Theoretical Computer Sciences\u00a0332(1-3), 265\u2013291 (2005)","journal-title":"Theoretical Computer Sciences"},{"issue":"1","key":"28_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.3233\/FI-2011-599","volume":"113","author":"G. Ita De","year":"2011","unstructured":"De Ita, G., Marcial-Romero, R., Hern\u00e1ndez, J.A.: A threshold for a Polynomial Solution of #2SAT. Fundamenta Informaticae\u00a0113(1), 63\u201377 (2011)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"28_CR3","first-page":"250","volume":"15","author":"G. Ita De","year":"2007","unstructured":"De Ita, G., Bello, P., Contreras, M.: New Polynomial Classes for #2SAT Established Via Graph-Topological Structure. Engineering Letters\u00a015(2), 250\u2013258 (2007), http:\/\/www.engineeringletters.com","journal-title":"Engineering Letters"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(91)90315-S","volume":"81","author":"D. Olivier","year":"1991","unstructured":"Olivier, D.: Counting the number of solutions for instances of satisfiability. Theor. Comp. Sc.\u00a081, 49\u201364 (1991)","journal-title":"Theor. Comp. Sc."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01758838","volume":"8","author":"D. Gusfield","year":"1992","unstructured":"Gusfield, D., Pitt, L.: A bounded approximation for the minimum cost 2-Sat problem. Algorithmica\u00a08, 103\u2013117 (1992)","journal-title":"Algorithmica"},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02128670","volume":"10","author":"N. Linial","year":"1990","unstructured":"Linial, N., Nisan, N.: Approximate inclusion-exclusion. Combinatorica\u00a010(4), 349\u2013365 (1990)","journal-title":"Combinatorica"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0020-0190(92)90160-W","volume":"41","author":"E. Lozinskii","year":"1992","unstructured":"Lozinskii, E.: Counting propositional models. Inf. Proc. Letters\u00a041, 327\u2013332 (1992)","journal-title":"Inf. Proc. Letters"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence\u00a082, 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"P. Vadhan Salil","year":"2001","unstructured":"Vadhan Salil, P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing\u00a031(2), 398\u2013427 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-79723-4_19","volume-title":"Parameterized and Exact Computation","author":"M. Wahlstr\u00f6m","year":"2008","unstructured":"Wahlstr\u00f6m, M.: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol.\u00a05018, pp. 202\u2013213. Springer, Heidelberg (2008)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Zhou, J., Yin, M., Zhou, C.: New Worts-Case Upper Bound for #2-SAT and #3-SAT with the Number of Clauses as the Parameter. In: Proc. of the AAAI, pp. 217\u2013222 (2010)","DOI":"10.1609\/aaai.v24i1.7537"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31149-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T22:47:10Z","timestamp":1687560430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31149-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311482","9783642311499"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31149-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}