Holger Dell, Thore Husfeldt, Martin Wahlen. Exponential Time Complexity of the Permanent and the Tutte Polynomial. In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul G. Spirakis, editors, Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Volume 6198 of Lecture Notes in Computer Science, pages 426-437, Springer, 2010. [doi]
@inproceedings{DellHW10-0,
title = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
author = {Holger Dell and Thore Husfeldt and Martin Wahlen},
year = {2010},
doi = {10.1007/978-3-642-14165-2_37},
url = {http://dx.doi.org/10.1007/978-3-642-14165-2_37},
researchr = {https://researchr.org/publication/DellHW10-0},
cites = {0},
citedby = {0},
pages = {426-437},
booktitle = {Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I},
editor = {Samson Abramsky and Cyril Gavoille and Claude Kirchner and Friedhelm Meyer auf der Heide and Paul G. Spirakis},
volume = {6198},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-14164-5},
}