A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 712-721

  Jerrum, Mark ^a   Sinclair, Alistair ^b   Vigoda, Eric ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MARKOV PROCESSES; MATRIX ALGEBRA; MONTE CARLO METHODS;

NON-NEGATIVE ENTRIES;

POLYNOMIAL APPROXIMATION;

EID: 0034832758     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380877     Document Type: Conference Paper

References (15)

1. Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor
2. How hard is it to marry at random?
3. Approximating the permanent
4. Fast uniform generation of regular graphs
5. The Markov chain Monte Carlo method: An approach to approximate counting and integration
6. Random generation of combinatorial structures from a uniform distribution
7. A mildly exponential approximation algorithm for the permanent
8. The statistics of dimers on a lattice, I., The number of dimer arrangements on a quadratic lattice
9. A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
10. On the number of Eulerian orientations of a graph
11. Permanents
12. A short proof of the factor theorem for finite graphs
13. The complexity of computing the permanent