Advanced

Exponential time complexity of the permanent and the Tutte polynomial

Dell, Holger; Husfeldt, Thore LU and Wahlén, Martin LU (2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) In Lecture Notes in Computer Science 6198. p.426-437
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Lecture Notes in Computer Science
volume
6198
pages
11 pages
publisher
Springer
conference name
37th International Colloquium on Automata, Languages and Programming (ICALP 2010)
external identifiers
  • scopus:77955323688
ISSN
1611-3349
0302-9743
DOI
10.1007/978-3-642-14165-2_37
project
Exact algorithms
language
English
LU publication?
yes
id
ddc285b2-9159-4e5a-b20c-22432cded52b (old id 1662653)
date added to LUP
2010-08-30 14:26:38
date last changed
2018-05-29 11:58:42
@inproceedings{ddc285b2-9159-4e5a-b20c-22432cded52b,
  author       = {Dell, Holger and Husfeldt, Thore and Wahlén, Martin},
  booktitle    = {Lecture Notes in Computer Science},
  issn         = {1611-3349},
  language     = {eng},
  pages        = {426--437},
  publisher    = {Springer},
  title        = {Exponential time complexity of the permanent and the Tutte polynomial},
  url          = {http://dx.doi.org/10.1007/978-3-642-14165-2_37},
  volume       = {6198},
  year         = {2010},
}