Exponential time complexity of the permanent and the Tutte polynomial

Holger Dell, Thore Husfeldt, Martin Wahlén

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Original language	English
Title of host publication	37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, July 6-10, 2010
Volume	6198
Publisher	Springer
Publication date	2010
Pages	426-437
Publication status	Published - 2010

Series	Lecture Notest in Computer Science

Cite this

@inproceedings{e8be4a5adee9476984062af820b66084,

title = "Exponential time complexity of the permanent and the Tutte polynomial",

author = "Holger Dell and Thore Husfeldt and Martin Wahl{\'e}n",

year = "2010",

language = "English",

volume = "6198",

series = "Lecture Notest in Computer Science",

publisher = "Springer",

pages = " 426--437",

booktitle = "37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, July 6-10, 2010",

address = "Germany",

}

Exponential time complexity of the permanent and the Tutte polynomial. / Dell, Holger; Husfeldt, Thore; Wahlén, Martin.
37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, July 6-10, 2010. Vol. 6198 Springer, 2010. p. 426-437 (Lecture Notest in Computer Science).

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

TY - GEN

T1 - Exponential time complexity of the permanent and the Tutte polynomial

AU - Dell, Holger

AU - Husfeldt, Thore

AU - Wahlén, Martin

PY - 2010

Y1 - 2010

M3 - Article in proceedings

VL - 6198

T3 - Lecture Notest in Computer Science

SP - 426

EP - 437

BT - 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, July 6-10, 2010

PB - Springer

ER -