Exponential time complexity of the permanent and the Tutte polynomial
(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:
https://lup.lub.lu.se/record/1662653
- author
- Dell, Holger ; Husfeldt, Thore LU and Wahlén, Martin LU
- organization
- publishing date
- 2010
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Automata, Languages and Programming
- series title
- Lecture Notes in Computer Science
- volume
- 6198
- pages
- 11 pages
- publisher
- Springer
- conference name
- 37th International Colloquium on Automata, Languages and Programming (ICALP 2010)
- conference location
- Bordeaux, France
- conference dates
- 2010-07-06 - 2010-07-10
- 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
- 2016-04-01 10:07:11
- date last changed
- 2025-01-14 06:22:11
@inproceedings{ddc285b2-9159-4e5a-b20c-22432cded52b, author = {{Dell, Holger and Husfeldt, Thore and Wahlén, Martin}}, booktitle = {{Automata, Languages and Programming}}, issn = {{1611-3349}}, language = {{eng}}, pages = {{426--437}}, publisher = {{Springer}}, series = {{Lecture Notes in Computer Science}}, title = {{Exponential time complexity of the permanent and the Tutte polynomial}}, url = {{http://dx.doi.org/10.1007/978-3-642-14165-2_37}}, doi = {{10.1007/978-3-642-14165-2_37}}, volume = {{6198}}, year = {{2010}}, }