{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:47Z","timestamp":1725558947865},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_37","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"426-437","source":"Crossref","is-referenced-by-count":11,"title":["Exponential Time Complexity of the Permanent and the Tutte Polynomial"],"prefix":"10.1007","author":[{"given":"Holger","family":"Dell","sequence":"first","affiliation":[]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Wahl\u00e9n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, M.: Determinant versus permanent. In: Proceedings of the 25th International Congress of Mathematicians, ICM, vol.\u00a03, pp. 985\u2013997 (2006)","DOI":"10.4171\/022-3\/48"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S.J. Berkowitz","year":"1984","unstructured":"Berkowitz, S.J.: On computing the determinant in small parallel time using a small number of processors. Information Processing Letters\u00a018(3), 147\u2013150 (1984)","journal-title":"Information Processing Letters"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s00453-007-9149-8","volume":"52","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica\u00a052(2), 226\u2013249 (2008)","journal-title":"Algorithmica"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: FOCS, pp. 677\u2013686 (2008)","DOI":"10.1109\/FOCS.2008.40"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/978-3-540-73420-8_69","volume-title":"Automata, Languages and Programming","author":"M. Bl\u00e4ser","year":"2007","unstructured":"Bl\u00e4ser, M., Dell, H.: Complexity of the cover polynomial. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 801\u2013812. Springer, Heidelberg (2007)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Brylawski, T.: The Tutte polynomial, Matroid theory and its applications. In: Centro Internazionale Matematico Estivo, pp. 125\u2013275 (1982)","DOI":"10.1007\/978-3-642-11110-5_3"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/050645208","volume":"20","author":"O. Gim\u00e9nez","year":"2006","unstructured":"Gim\u00e9nez, O., Hlin\u011bn\u00fd, P., Noy, M.: Computing the Tutte polynomial on graphs of bounded clique-width. SIAM J. on Discrete Mathematics\u00a020, 932\u2013946 (2006)","journal-title":"SIAM J. on Discrete Mathematics"},{"issue":"1","key":"37_CR8","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 and Computing\u00a016(1), 43\u201361 (2007)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"7","key":"37_CR9","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. Information and Computation\u00a0206(7), 908\u2013929 (2008)","journal-title":"Information and Computation"},{"issue":"4","key":"37_CR10","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences\u00a063(4), 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Istrail, S.: Statistical mechanics, three-dimensionality and NP-completeness. I. universality of intractability for the partition function of the Ising model across non-planar lattices. In: STOC, pp. 87\u201396 (2000)","DOI":"10.1145\/335305.335316"},{"issue":"1","key":"37_CR12","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. Math. Proc. Cambridge\u00a0108(1), 35\u201353 (1990)","journal-title":"Math. Proc. Cambridge"},{"issue":"3","key":"37_CR13","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M. Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. Journal of the ACM\u00a029(3), 874\u2013897 (1982)","journal-title":"Journal of the ACM"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: Partitioning into sets of bounded cardinality. In: IWPEC, pp. 258\u2013263 (2009)","DOI":"10.1007\/978-3-642-11269-0_21"},{"issue":"1","key":"37_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2007.06.017","volume":"105","author":"K. Kutzkov","year":"2007","unstructured":"Kutzkov, K.: New upper bound for the #3-SAT problem. Information Processing Letters\u00a0105(1), 1\u20135 (2007)","journal-title":"Information Processing Letters"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A note on the complexity of the chromatic number problem. Information Processing Letters\u00a05, 66\u201367 (1976)","journal-title":"Information Processing Letters"},{"key":"37_CR17","volume-title":"Computational Complexity","author":"C.M. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"2","key":"37_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1502793.1502797","volume":"56","author":"R. Raz","year":"2009","unstructured":"Raz, R.: Multi-linear formulas for permanent and determinant are of super-polynomial size. Journal of the ACM\u00a056(2), 1\u201317 (2009)","journal-title":"Journal of the ACM"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Ryser, H.J.: Combinatorial mathematics. Carus Math. Monographs, vol.\u00a014. Mathematical Association of America (1963)","DOI":"10.5948\/UPO9781614440147"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BFb0015427","volume-title":"Algorithms and Computations","author":"K. Sekine","year":"1995","unstructured":"Sekine, K., Imai, H., Tani, S.: Computing the Tutte polynomial of a graph of moderate size. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol.\u00a01004, pp. 224\u2013233. Springer, Heidelberg (1995)"},{"issue":"02","key":"37_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1017\/S0963548303006023","volume":"13","author":"A.D. Sokal","year":"2004","unstructured":"Sokal, A.D.: Chromatic roots are dense in the whole complex plane. Combinatorics, Probability and Computing\u00a013(02), 221\u2013261 (2004)","journal-title":"Combinatorics, Probability and Computing"},{"key":"37_CR22","series-title":"London Mathematical Society Lecture Note Series","first-page":"173","volume-title":"Surveys in Combinatorics","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. London Mathematical Society Lecture Note Series, vol.\u00a0327, pp. 173\u2013226. Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"37_CR23","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(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"}],"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-14165-2_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T15:30:10Z","timestamp":1635607810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}