An analysis of a Monte Carlo algorithm for estimating the permanent

This publication has 12 references indexed in Scilit:

• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
  Combinatorics, Probability and Computing, 1994
• A Monte-Carlo Algorithm for Estimating the Permanent
  SIAM Journal on Computing, 1993
• Highly resilient correctors for polynomials
  Information Processing Letters, 1992
• Counting the Number of Hamilton Cycles in Random Digraphs
  Random Structures & Algorithms, 1992
• Approximating the Permanent
  SIAM Journal on Computing, 1989
• On coupling and the approximation of the permanent
  Information Processing Letters, 1989
• How hard is it to marry at random? (On the approximation of the permanent)
  Published by Association for Computing Machinery (ACM) ,1986
• Random generation of combinatorial structures from a uniform distribution
  Theoretical Computer Science, 1986
• Monte-Carlo algorithms for enumeration and reliability problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Some Theorems on Abstract Graphs
  Proceedings of the London Mathematical Society, 1952