{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:06Z","timestamp":1725558966530},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","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-14165-2_34","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"396-407","source":"Crossref","is-referenced-by-count":5,"title":["Approximating the Partition Function of the Ferromagnetic Potts Model"],"prefix":"10.1007","author":[{"given":"Leslie Ann","family":"Goldberg","sequence":"first","affiliation":[]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"34_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/rsa.3240060409","volume":"6","author":"N. Alon","year":"1995","unstructured":"Alon, N., Frieze, A., Welsh, D.: Polynomial time randomized approximation schemes for Tutte-Gr\u00f6thendieck invariants: the dense case. Random Structures Algorithms\u00a06(4), 459\u2013478 (1995)","journal-title":"Random Structures Algorithms"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF01213683","volume":"104","author":"B. Bollob\u00e1s","year":"1996","unstructured":"Bollob\u00e1s, B., Grimmett, G., Janson, S.: The random-cluster model on the complete graph. Probab. Theory Related Fields\u00a0104(3), 283\u2013317 (1996)","journal-title":"Probab. Theory Related Fields"},{"doi-asserted-by":"crossref","unstructured":"Bordewich, M.: On the approximation complexity hierarchy (in preparation, 2010)","key":"34_CR3","DOI":"10.1007\/978-3-642-18318-8_4"},{"doi-asserted-by":"crossref","unstructured":"Chebolu, P., Goldberg, L.A., Martin, R.: Approximately counting stable matchings (in preparation, 2010)","key":"34_CR4","DOI":"10.1007\/978-3-642-15369-3_7"},{"doi-asserted-by":"crossref","unstructured":"Dalmau, V.: Linear datalog and bounded path duality of relational structures. Logical Methods in Computer Science\u00a01(1) (2005)","key":"34_CR5","DOI":"10.2168\/LMCS-1(1:5)2005"},{"issue":"3","key":"34_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00453-003-1073-y","volume":"38","author":"M.E. Dyer","year":"2003","unstructured":"Dyer, M.E., Goldberg, L.A., Greenhill, C.S., Jerrum, M.: The relative complexity of approximate counting problems. Algorithmica\u00a038(3), 471\u2013500 (2003)","journal-title":"Algorithmica"},{"unstructured":"Ge, Q., Stefankovic, D.: A graph polynomial for independent sets of bipartite graphs. CoRR, abs\/0911.4732 (2009)","key":"34_CR7"},{"unstructured":"Goldberg, L.A., Jerrum, M.: Counterexample to rapid mixing of the GS Process. Technical note (2010)","key":"34_CR8"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1017\/S096354830600767X","volume":"16","author":"L.A. Goldberg","year":"2007","unstructured":"Goldberg, L.A., Jerrum, M.: The complexity of ferromagnetic Ising with local fields. Combinatorics, Probability & Computing\u00a016(1), 43\u201361 (2007)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"7","key":"34_CR10","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ic.2008.04.003","volume":"206","author":"L.A. Goldberg","year":"2008","unstructured":"Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial. Inform. and Comput.\u00a0206(7), 908\u2013929 (2008)","journal-title":"Inform. and Comput."},{"unstructured":"Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial of a planar graph. CoRR, abs\/0907.1724 (2009)","key":"34_CR11"},{"issue":"1-2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02186281","volume":"75","author":"G. Grimmett","year":"1994","unstructured":"Grimmett, G.: Potts models and random-cluster processes with many-body interactions. J. Statist. Phys.\u00a075(1-2), 67\u2013121 (1994)","journal-title":"J. Statist. Phys."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01645980","volume":"36","author":"R. Holley","year":"1974","unstructured":"Holley, R.: Remarks on the FKG inequalities. Comm. Math. Phys.\u00a036, 227\u2013231 (1974)","journal-title":"Comm. Math. Phys."},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0305004100068936","volume":"108","author":"F. Jaeger","year":"1990","unstructured":"Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc.\u00a0108(1), 35\u201353 (1990)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"5","key":"34_CR15","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/0222066","volume":"22","author":"M. Jerrum","year":"1993","unstructured":"Jerrum, M., Sinclair, A.: Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput.\u00a022(5), 1087\u20131116 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2-3","key":"34_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M.R. Jerrum","year":"1986","unstructured":"Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci.\u00a043(2-3), 169\u2013188 (1986)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Kelk, S.: On the relative complexity of approximately counting H-colourings. PhD thesis, University of Warwick, Coventry, UK (July 2004)","key":"34_CR17"},{"issue":"2","key":"34_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/rsa.20088","volume":"28","author":"M. Luczak","year":"2006","unstructured":"Luczak, M., \u0141uczak, T.: The phase transition in the cluster-scaled model of a random graph. Random Structures Algorithms\u00a028(2), 215\u2013246 (2006)","journal-title":"Random Structures Algorithms"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1017\/S0305004100027419","volume":"48","author":"R.B. Potts","year":"1952","unstructured":"Potts, R.B.: Some generalized order-disorder transformations. Proc. Cambridge Philos. Soc.\u00a048, 106\u2013109 (1952)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"34_CR20","volume-title":"Surveys in Combinatorics","author":"A. Sokal","year":"2005","unstructured":"Sokal, A.: The multivariate Tutte polynomial. In: Surveys in Combinatorics. Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"34_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1017\/S0963548300000195","volume":"1","author":"D.L. Vertigan","year":"1992","unstructured":"Vertigan, D.L., Welsh, D.J.A.: The computational complexity of the Tutte plane: the bipartite case. Combin. Probab. Comput.\u00a01(2), 181\u2013187 (1992)","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"34_CR22","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1137\/S0097539704446797","volume":"35","author":"D. Vertigan","year":"2005","unstructured":"Vertigan, D.: The computational complexity of Tutte invariants for planar graphs. SIAM J. Comput.\u00a035(3), 690\u2013712 (2005) (electronic)","journal-title":"SIAM J. Comput."},{"key":"34_CR23","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511752506","volume-title":"Complexity: knots, colourings and counting","author":"D.J.A. Welsh","year":"1993","unstructured":"Welsh, D.J.A.: Complexity: knots, colourings and counting. London Mathematical Society Lecture Note Series, vol.\u00a0186. Cambridge University Press, Cambridge (1993)"},{"issue":"6","key":"34_CR24","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1137\/S0097539794266407","volume":"25","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: On unapproximable versions of NP-Complete problems. SIAM Journal on Computing\u00a025(6), 1293\u20131304 (1996)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:40:41Z","timestamp":1558280441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}