Exponential time complexity of the permanent and the Tutte polynomial

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Originalsprog	Engelsk
Titel	37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, July 6-10, 2010
Vol/bind	6198
Forlag	Springer
Publikationsdato	2010
Sider	426-437
Status	Udgivet - 2010

Navn	Lecture Notest in Computer Science

Citationsformater

@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. Bind 6198 Springer, 2010. s. 426-437 (Lecture Notest in Computer Science).

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › 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 -