Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case

This publication has 18 references indexed in Scilit:

• Polynomial-time approximation algorithms for the ising model
  Published by Springer Nature ,2005
• Polynomial-Time Approximation Algorithms for the Ising Model
  SIAM Journal on Computing, 1993
• A Monte-Carlo Algorithm for Estimating the Permanent
  SIAM Journal on Computing, 1993
• The Tutte Polynomial and Its Applications
  Published by Cambridge University Press (CUP) ,1992
• On the computational complexity of the Jones and Tutte polynomials
  Mathematical Proceedings of the Cambridge Philosophical Society, 1990
• A spanning tree expansion of the jones polynomial
  Topology, 1987
• The complexity of colouring problems on dense graphs
  Theoretical Computer Science, 1986
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
  Journal of Complexity, 1985
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
  Memoirs of the American Mathematical Society, 1975
• On the random-cluster model
  Physica, 1972