Random generation of combinatorial structures from a uniform
Theoretical Computer Science
NP is as easy as detecting unique solutions
Theoretical Computer Science
Polynomial-time approximation algorithms for the Ising model
SIAM Journal on Computing
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
On Unapproximable Versions of NP-Complete Problems
SIAM Journal on Computing
Polynomial time randomized approximation schemes for Tutte-Gro¨thendieck invariants: the dense case
Random Structures & Algorithms
The complexity of counting graph homomorphisms
Proceedings of the ninth international conference on on Random structures and algorithms
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Inapproximability of the Tutte polynomial
Information and Computation
Complexity of the Bollobás-Riordan polynomial: exceptional points and uniform reductions
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A Complexity Dichotomy for Partition Functions with Mixed Signs
SIAM Journal on Computing
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
| Hi-index | 0.00 |
The Tutte polynomial of a graph G is a two-variable polynomial T(G;x,y) that encodes many interesting properties of the graph. We study the complexityof the following problem, for rationals x and y: take as input a graph G, and output a value which is a good approximation to T(G;x,y). We are interested in determining for which points (x,y) there is a fullypolynomial randomised approximation scheme (FPRAS) for T(G;x,y). Our main contribution is a substantial widening of the region known to benon-FPRASable.