{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:48:00Z","timestamp":1725587280173},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220050"},{"type":"electronic","value":"9783642220067"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22006-7_44","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T07:44:05Z","timestamp":1308555845000},"page":"521-532","source":"Crossref","is-referenced-by-count":2,"title":["A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid"],"prefix":"10.1007","author":[{"given":"Leslie Ann","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"44_CR1","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.1997.1767","volume":"70","author":"A. Andrzejak","year":"1997","unstructured":"Andrzejak, A.: Splitting formulas for Tutte polynomials. J. Combin. Theory Ser. B\u00a070(2), 346\u2013366 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-642-14165-2_34","volume-title":"Automata, Languages and Programming","author":"L. Goldberg","year":"2010","unstructured":"Goldberg, L., Jerrum, M.: Approximating the partition function of the ferromagnetic potts model. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 396\u2013407. Springer, Heidelberg (2010)"},{"issue":"7","key":"44_CR3","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."},{"key":"44_CR4","unstructured":"Goldberg, L.A., Jerrum, M.: Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. arXiv:1006.5234v1 (cs.CC) (2010)"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Goldberg, L.A., Jerrum, M.: A polynomial-time algorithm for estimating the partition function of the ferromagnetic ising model on a regular matroid. arXiv:1010.6231v1 (cs.CC) (2010)","DOI":"10.1007\/978-3-642-22006-7_44"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45471-3_21","volume-title":"Algorithm Theory - SWAT 2002","author":"A. Golynski","year":"2002","unstructured":"Golynski, A., Horton, J.D.: A polynomial time algorithm to find the minimum cycle basis of a regular matroid. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 200\u2013209. Springer, Heidelberg (2002)"},{"issue":"1","key":"44_CR7","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":"44_CR8","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."},{"key":"44_CR9","series-title":"Oxford Science Publications","volume-title":"Matroid theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid theory. Oxford Science Publications. Oxford Science Publications, The Clarendon Press Oxford University Press, New York (1992)"},{"key":"44_CR10","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."},{"issue":"3","key":"44_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Combin. Theory Ser. B\u00a028(3), 305\u2013359 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"key":"44_CR12","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/CBO9780511734885.009","volume-title":"Surveys in Combinatorics 2005","author":"A.D. Sokal","year":"2005","unstructured":"Sokal, A.D.: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Surveys in Combinatorics 2005. London Math. Soc. Lecture Note Ser., vol.\u00a0327, pp. 173\u2013226. Cambridge Univ. Press, Cambridge (2005)"},{"key":"44_CR13","volume-title":"Matroid decomposition","author":"K. Truemper","year":"1992","unstructured":"Truemper, K.: Matroid decomposition. Academic Press Inc., Boston (1992)"},{"issue":"2","key":"44_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0095-8956(90)90030-4","volume":"49","author":"K. Truemper","year":"1990","unstructured":"Truemper, K.: A decomposition theory for matroids. V. Testing of matrix total unimodularity. J. Combin. Theory Ser. B\u00a049(2), 241\u2013281 (1990)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22006-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T23:24:35Z","timestamp":1637882675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22006-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220050","9783642220067"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22006-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}