{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:03:00Z","timestamp":1725897780522},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_34","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"399-410","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)"],"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":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-14165-2_37","volume-title":"Automata, Languages and Programming","author":"H. Dell","year":"2010","unstructured":"Dell, H., Husfeldt, T., Wahl\u00e9n, M.: Exponential Time Complexity of the Permanent and the Tutte Polynomial. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 426\u2013437. Springer, Heidelberg (2010)"},{"key":"34_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.A. Goldberg","year":"2010","unstructured":"Goldberg, L.A., 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":"34_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":"34_CR4","unstructured":"Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial of a planar graph. CoRR, abs\/0907.1724 (2009); To appear \u201dComputational Complexity\u201d"},{"key":"34_CR5","unstructured":"Goldberg, L.A., Jerrum, M.: Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. CoRR, abs\/1006.5234 (2010)"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1017\/S0963548300000705","volume":"2","author":"B. Jackson","year":"1993","unstructured":"Jackson, B.: A zero-free interval for chromatic polynomials of graphs. Combinatorics, Probability & Computing\u00a02, 325\u2013336 (1993)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"6","key":"34_CR7","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.jctb.2009.03.002","volume":"99","author":"B. Jackson","year":"2009","unstructured":"Jackson, B., Sokal, A.D.: Zero-free regions for multivariate Tutte polynomials (alias potts-model partition functions) of graphs and matroids. J. Comb. Theory, Ser. B\u00a099(6), 869\u2013903 (2009)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"34_CR8","unstructured":"Jacobsen, J.L., Salas, J.: Is the five-flow conjecture almost false? ArXiv e-prints (September 2010)"},{"issue":"1","key":"34_CR9","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":"4","key":"34_CR10","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput.\u00a012(4), 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"34_CR11","unstructured":"Sokal, A.: The multivariate Tutte polynomial. In: Surveys in Combinatorics, Cambridge University Press (2005)"},{"issue":"3","key":"34_CR12","doi-asserted-by":"crossref","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 (electronic) (2005)","journal-title":"SIAM J. Comput."}],"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-31594-7_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:15:00Z","timestamp":1620130500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}