Exponential Time Complexity of the Permanent and the Tutte Polynomial - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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]

The following publications are possibly variants of this publication:

Exponential Time Complexity of the Permanent and the Tutte PolynomialHolger Dell, Thore Husfeldt, Martin Wahlen. eccc, 17:78, 2010. [doi]

Exponential Time Complexity of the Permanent and the Tutte PolynomialHolger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen. TALG, 10(4):21, 2014. [doi]

runs on WebDSL