{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:58:04Z","timestamp":1725573484430},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159916"},{"type":"electronic","value":"9783642159923"}],"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-15992-3_34","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T19:10:51Z","timestamp":1292872251000},"page":"322-331","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Method for Counting Models on Grid Boolean Formulas"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Guill\u00e9n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"De Ita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aurelio","family":"L\u00f3pez-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01608783","volume":"3","author":"R.J. Baxter","year":"1999","unstructured":"Baxter, R.J.: Planar Lattice Gases with Nearest-Neighbour Exclusion. Annals of Combinatorics\u00a03, 191\u2013203 (1999)","journal-title":"Annals of Combinatorics"},{"key":"34_CR2","unstructured":"Guill\u00e9n, C., Vera, E., L\u00f3pez-L\u00f3pez, A., De Ita, G.: Applying the Transfer Matrix Method for Supervising Lines in a Network Grid. In: Proc. REV 2008 (2008),\n                    \n                      www.rev-conference.org"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Barbosa, V.C., Ferreira, R.G.: On the phase transitions of graph coloring and independent sets. Physica A: Statistical Mechanics and its Applications\u00a0343, 401\u2013423 (2004)","DOI":"10.1016\/j.physa.2004.05.055"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/S089548019528993X","volume":"11","author":"N.J. Calkin","year":"1998","unstructured":"Calkin, N.J.: The Number of Independent Sets in a Grid Graph. SIAM Journal on Discrete Mathematics\u00a011(1), 54\u201360 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s00453-007-9090-x","volume":"51","author":"B. G\u00e4rtner","year":"2008","unstructured":"G\u00e4rtner, B., Morris, W., R\u00fcst, L.: Unique Sink Orientations of Grids. Algorithmica\u00a051(2), 200\u2013235 (2008)","journal-title":"Algorithmica"},{"key":"34_CR6","unstructured":"Golin, M.J., Leung, Y.C., Wang, Y., Yong, X.: Counting Structures in Grid Graphs, Cylinders and Tori Transfer Matrices: Survey and New Results. In: ALENEX\/ANALCO, pp. 250\u2013258 (2005)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Constraint Solving via Fractional Edge Covers. In: Soda\u201906, Miami (2006)","DOI":"10.1145\/1109557.1109590"},{"issue":"2","key":"34_CR8","first-page":"1","volume":"88","author":"E. Reinhardt","year":"2005","unstructured":"Reinhardt, E.: The Fibonacci Number of a Grid Graph and a New Class of Integer Sequences. JIS Journal of Integer Sequences\u00a088(2), 1\u201316 (2005) Article 05.2.6","journal-title":"JIS Journal of Integer Sequences"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Roth, D.: On the Hardness of Approximate Reasoning. Artificial Intelligence, 273\u2013302 (1996)","DOI":"10.1016\/0004-3702(94)00092-1"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1109\/18.915673","volume":"47","author":"R.M. Roth","year":"2001","unstructured":"Roth, R.M., Siegel, P.H., Wolf, J.K.: Efficient Coding Schemes for the Hard-Square Model. IEEE Trans. Inform. Theory\u00a047, 1166\u20131176 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"34_CR11","volume-title":"Randomized Algorithms: Approximation, Generation, and Counting, Distinguished dissertations","author":"B. Russ","year":"2001","unstructured":"Russ, B.: Randomized Algorithms: Approximation, Generation, and Counting, Distinguished dissertations. Springer, Heidelberg (2001)"},{"issue":"2","key":"34_CR12","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":"34_CR13","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput.\u00a08(3) (1979)","DOI":"10.1137\/0208032"}],"container-title":["Lecture Notes in Computer Science","Advances in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15992-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:49:17Z","timestamp":1553276957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15992-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159916","9783642159923"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15992-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}