{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:39Z","timestamp":1794516759452,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_750","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:52Z","timestamp":1461269032000},"page":"117-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximating the Partition Function of Two-Spin Systems"],"prefix":"10.1007","author":[{"given":"Pinyan","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"2\u20133","key":"750_CR1474","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2005.09.011","volume":"348","author":"AA Bulatov","year":"2005","unstructured":"Bulatov AA, Grohe M (2005) The complexity of partition functions. Theor Comput Sci 348(2\u20133):148\u2013186","journal-title":"Theor Comput Sci"},{"issue":"2","key":"750_CR1475","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/rsa.10090","volume":"23","author":"LA Goldberg","year":"2003","unstructured":"Goldberg LA, Jerrum M, Paterson M (2003) The computational complexity of two-state spin systems. Random Struct Algorithms 23(2):133\u2013154","journal-title":"Random Struct Algorithms"},{"issue":"5","key":"750_CR1476","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/0222066","volume":"22","author":"M Jerrum","year":"1993","unstructured":"Jerrum M, Sinclair A (1993) Polynomial-time approximation algorithms for the ising model. SIAM J Comput 22(5):1087\u20131116","journal-title":"SIAM J Comput"},{"key":"750_CR1477","first-page":"922","volume-title":"Approximate counting via correlation decay in spin systems","author":"L Li","year":"2012","unstructured":"Li L, Lu P, Yin Y (2012) Approximate counting via correlation decay in spin systems. In: Proceedings of SODA, Kyoto, pp\u00a0922\u2013940"},{"key":"750_CR1478","first-page":"67","volume-title":"Correlation decay up to uniqueness in spin systems","author":"L Li","year":"2013","unstructured":"Li L, Lu P, Yin Y (2013) Correlation decay up to uniqueness in spin systems. In: Proceedings of SODA, New Orleans, pp\u00a067\u201384"},{"key":"750_CR1479","volume-title":"The complexity of ferromagnetic two-spin systems with external fields","author":"J Liu","year":"2014","unstructured":"Liu J, Lu P, Zhang C (2014) The complexity of ferromagnetic two-spin systems with external fields. In: Proceedings of RANDOM, Barcelona. To appear"},{"key":"750_CR1480","doi-asserted-by":"crossref","unstructured":"Lu P, Wang M, Zhang C (2014) Fptas for weighted fibonacci gates and its applications. In: Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E (eds) ICALP (1), Copenhagen. Lecture Notes in Computer Science, vol\u00a08572. Springer, pp\u00a0787\u2013799","DOI":"10.1007\/978-3-662-43948-7_65"},{"key":"750_CR1481","first-page":"941","volume-title":"Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs","author":"A Sinclair","year":"2012","unstructured":"Sinclair A, Srivastava P, Thurley M (2012) Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. In: Proceedings of SODA, Kyoto, pp\u00a0941\u2013953"},{"key":"750_CR1482","first-page":"300","volume-title":"Spatial mixing and approximation algorithms for graphs with bounded connective constant","author":"A Sinclair","year":"2013","unstructured":"Sinclair A, Srivastava P, Yin Y (2013) Spatial mixing and approximation algorithms for graphs with bounded connective constant. In: Proceedings of FOCS, Berkeley, pp\u00a0300\u2013309"},{"key":"750_CR1483","volume-title":"Spatial mixing and the connective constant: Optimal bounds","author":"A Sinclair","year":"2015","unstructured":"Sinclair A, Srivastava P, \u0160tefankovi\u010d D, Yin Y (2015) Spatial mixing and the connective constant: Optimal bounds. In: Proceedings of SODA, San Diego. To appear"},{"key":"750_CR1484","first-page":"361","volume-title":"The computational hardness of counting in two-spin models on d-regular graphs","author":"A Sly","year":"2012","unstructured":"Sly A, Sun N (2012) The computational hardness of counting in two-spin models on d-regular graphs. In: Proceedings of FOCS, New Brunswick, pp\u00a0361\u2013369"},{"key":"750_CR1485","first-page":"140","volume-title":"Counting independent sets up to the tree threshold","author":"D Weitz","year":"2006","unstructured":"Weitz D (2006) Counting independent sets up to the tree threshold. In: Proceedings of STOC, Seattle, pp\u00a0140\u2013149"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:51:01Z","timestamp":1792108261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_750","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}