Cited in
(11)- Fine-grained dichotomies for the Tutte plane and Boolean \#CSP
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
- Complexity and approximability of the cover polynomial
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- The exponential time complexity of computing the probability that a graph is connected
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth
- tutte
- Computational resources
- Parallel family trees for transfer matrices in the Potts model
- tuttepol
- Algorithmic Pirogov-Sinai theory
This page was built for software: tutte_bhkk
