Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ICALP
2010
Springer

favoriteEmaildiscussreport

102views Programming Languages» more ICALP 2010»

Exponential Time Complexity of the Permanent and the Tutte Polynomial

13 years 9 months ago

Exponential Time Complexity of the Permanent and the Tutte Polynomial

Download www2.informatik.hu-berlin.de

Holger Dell, Thore Husfeldt, Martin Wahlen

Real-time Traffic

ICALP 2010 | Programming Languages |

claim paper

Related Content

» Computing the Tutte Polynomial in VertexExponential Time

» Linear Polynomial or Exponential Complexity Inference in Polynomial Time

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» Diagonal Circuit Identity Testing and Lower Bounds

» In Search of an Easy Witness Exponential Time vs Probabilistic Polynomial Time

» On Parameterized Exponential Time Complexity

» Arithmetic Circuits and the Hadamard Product of Polynomials

» On the Complexity of Hmelevskiis Theorem and Satisfiability of Three Unknown Equations

» On ExponentialTime Completeness of the Circularity Problem for Attribute Grammars

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	ICALP
Authors	Holger Dell, Thore Husfeldt, Martin Wahlen

Comments (0)