A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Top Cited Papers
- 1 July 2004
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 51 (4) , 671-697
- https://doi.org/10.1145/1008731.1008738
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate PermanentsCombinatorica, 2000
- Chernoff-type bound for finite Markov chainsThe Annals of Applied Probability, 1998
- A mildly exponential approximation algorithm for the permanentAlgorithmica, 1996
- Comparison Theorems for Reversible Markov ChainsThe Annals of Applied Probability, 1993
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- Fast uniform generation of regular graphsTheoretical Computer Science, 1990
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated AnnealingProbability in the Engineering and Informational Sciences, 1987
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- The complexity of computing the permanentTheoretical Computer Science, 1979
- A Short Proof of the Factor Theorem for Finite GraphsCanadian Journal of Mathematics, 1954