Martin Wahlén
- Exponential Time Complexity of the Permanent and the Tutte Polynomial
2012/06/08 by Holger Dell, Thore Husfeldt, Dániel Marx +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Binary logarithm #Chromatic polynomial #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Enumeration #Exponential function #Exponential time hypothesis #Graph #Lemma (botany) #Markov Chains and Monte Carlo Methods #Mathematics #Multigraph #Satisfiability #Time complexity #Tutte polynomial #Vertex (graph theory) #cs.CC #cs.DS #math.CO