{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:36:03Z","timestamp":1787499363050,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540734192","type":"print"},{"value":"9783540734208","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_69","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T10:58:43Z","timestamp":1188039523000},"page":"801-812","source":"Crossref","is-referenced-by-count":13,"title":["Complexity of the Cover Polynomial"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger","family":"Dell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jctb.1995.1055","volume":"65","author":"F.R. Chung","year":"1995","unstructured":"Chung, F.R., Graham, R.L.: On the cover polynomial of a digraph. Journal of Combinatorial Theory Series B\u00a065, 273\u2013290 (1995)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"69_CR2","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.: On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society\u00a0108, 35\u201353 (1990)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0196-8858(03)00087-3","volume":"32","author":"M. Lotz","year":"2004","unstructured":"Lotz, M., Makowsky, J.A.: On the algebraic complexity of some families of coloured Tutte polynomials. Advances in Applied Mathematics\u00a032, 327\u2013349 (2004)","journal-title":"Advances in Applied Mathematics"},{"key":"69_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0963548398003447","volume":"8","author":"B. Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s, B., Riordan, O.: A Tutte polynomial for coloured graphs. Combinatorics, Probability and Computing\u00a08, 45\u201393 (1999)","journal-title":"Combinatorics, Probability and Computing"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1017\/S0963548305007327","volume":"15","author":"O. Gim\u00e9nez","year":"2006","unstructured":"Gim\u00e9nez, O., Noy, M.: On the complexity of computing the Tutte polynomial of bicircular matroids. Combinatorics, Probability and Computing\u00a015, 385\u2013395 (2006)","journal-title":"Combinatorics, Probability and Computing"},{"key":"69_CR6","doi-asserted-by":"crossref","unstructured":"Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial (2006)","DOI":"10.1145\/1250790.1250858"},{"key":"69_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2005.09.011","volume":"348","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Grohe, M.: The complexity of partition functions. Theoretical Computer Science\u00a0348, 148\u2013186 (2005)","journal-title":"Theoretical Computer Science"},{"key":"69_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/11786986_5","volume-title":"Automata, Languages and Programming","author":"M.E. Dyer","year":"2006","unstructured":"Dyer, M.E., Goldberg, L.A., Paterson, M.: On counting homomorphisms to directed acyclic graphs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 38\u201349. Springer, Heidelberg (2006)"},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"69_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/aama.2000.0689","volume":"25","author":"O.M. D\u2019Antona","year":"2000","unstructured":"D\u2019Antona, O.M., Munarini, E.: The cycle-path indicator polynomial of a digraph. Adv. Appl. Math.\u00a025, 41\u201356 (2000)","journal-title":"Adv. Appl. Math."},{"key":"69_CR11","unstructured":"Bl\u00e4ser, M., Dell, H.: Complexity of the cover polynomial (journal version) (to appear)"},{"key":"69_CR12","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1137\/S009753979426112X","volume":"27","author":"M.E. Dyer","year":"1998","unstructured":"Dyer, M.E., Frieze, A.M., Jerrum, M.: Approximately counting Hamilton paths and cycles in dense graphs. SIAM Journal on Computing\u00a027, 1262\u20131272 (1998)","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-540-73420-8_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:26Z","timestamp":1619503886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}