A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Non-Negative Entries

A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Non-Negative Entries (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Mark Jerrum , Alistair Sinclair , Eric Vigoda

Venue:	Journal of the ACM
Citations:	253 - 21 self

BibTeX

@ARTICLE{Jerrum04apolynomial-time,
    author = {Mark Jerrum and Alistair Sinclair and Eric Vigoda},
    title = {A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Non-Negative Entries},
    journal = {Journal of the ACM},
    year = {2004},
    pages = {671--697}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Abstract. We present a polynomial-time randomized algorithm for estimating the permanent of an arbitrary n ×n matrix with nonnegative entries. This algorithm—technically a “fully-polynomial randomized approximation scheme”—computes an approximation that is, with high probability, within arbitrarily small specified relative error of the true value of the permanent. Categories and Subject Descriptors: F.2.2 [Analysis of algorithms and problem complexity]: Nonnumerical

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
1577	An Introduction to Probability Theory and Its Applications Volume I. 3rd edition - Feller - 1968
1567	Randomized Algorithms - Motwani, Raghavan - 1995
1478	The probabilistic method - Spencer - 1992
409	The complexity of computing the permanent - Valiant - 1979
299	The Art of Computer Programming, volume 1 (Fundamental Algorithms - Knuth - 1973
289	Eigenvalues and expanders - Alon - 1986
257	Approximating the Permanent - Jerrum, Sinclair - 1989
250	Random Generation of Combinatorial Structures from a Uniform Distributions, Theoret. Computer Sci - Jerrum, Valiant, et al. - 1986
233	Geometric bounds for eigenvalues of Markov chains,” The Annals of Applied Probability - Diaconis, Stroock - 1991
216	Approximate counting, uniform generation and rapidly mixing Markov chains - Sinclair, Jerrum - 1989
203	The Markov chain Monte Carlo method: An approach to approximate counting and integration - Jerrum, Sinclair - 1996
172	Optimization by Simulated Annealing. Science 220 - Kirkpatrick, Jr, et al. - 1983
159	lower bound for the smallest eigenvalue of the Laplacian - Cheeger, “A - 1970
158	Improved bounds for mixing rates of Markov chains and multicommodity flow - Sinclair - 1992
136	Comparison theorems for reversible Markov chains - Diaconis, Saloff-Coste - 1993
130	A random polynomial time algorithm for approximating the volume of a convex body - Dyer, Frieze, et al. - 1991
114	The statistics of dimers on a lattice, I., The number of dimer arrangements on a quadratic lattice, Physica 27 - Kasteleyn - 1961
111	Beitrag zur Theorie des Ferromagnetismus. Dissertation - Ising - 1924
109	Monte-Carlo algorithms for enumeration and reliability problems - KARP, LUBY - 1983
104	On the computational complexity of Ising spin glass models - Barahona - 1982
80	Difference equations, isoperimetric inequality and transience of certain random walks - Dodziuk - 1984
71	On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing - Aldous - 1987
67	statistics and phase transition - Kasteleyn
66	A Chernoff bound for random walks on expander graphs - Gillman - 1998
62	How hard is to marry at random? (On the approximation of the permanent - Broder - 1986
59	Isoperimetric numbers of graphs - Mohar - 1989
59	Counting, Sampling and Integrating: algorithms and complexity - Jerrum - 2003
56	The complexity of computing the permanent. Theoretical computer science - Valiant - 1979
50	A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents - Linial, Samorodnitsky, et al. - 2000
34	Two-dimensional monomer-dimer systems are computationally intractable - Jerrum - 1987
32	A short proof of the factors theorem for finite graphs - Tutte - 1954
29	Fast uniform generation of regular graphs - Jerrum, Sinclair - 1990
28	On the dimer solution of planar Ising models - Fisher - 1966
28	A mildly exponential approximation algorithm for the permanent, Algorithmica 16 - Jerrum, Vazirani - 1996
27	An introduction to the Ising model - Cipra - 1987
27	Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures & Algorithms - Barvinok - 1999
26	Some observations on probabilistic algorithms and NPhard problems - KO - 1982
24	Bounds on the L spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality - Lawler, Sokal - 1988
20	Randomized Algorithms for Counting and Generating Combinatorial Structures - Sinclair - 1988
20	The computational complexity of some classical problems from statistical physics - WELSH - 1990
19	Some NP-complete problems - Garey, Graham, et al. - 1976
17	On the number of Eulerian orientations of a graph - Mihail, Winkler - 1992
15	Chernoff-type Bound for Finite Markov Chains - Lezaud - 1998
14	Vazirani “Random generation of Combinatorial structures from a uniform distribution,” Theoretical Computer Science - Jerrum, Valiant, et al. - 1986
12	Fast uniform generation of regular graphs, Theor - Jerrum, Sinclair - 1990
9	On the Number of Eulerian Orientations of a Graph, Algorithmica 16 - Mihail, Winkler - 1996
8	Avi Wigderson. A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents - Linial, Samorodnitsky
7	Beitrag zum Verständnis der magnetishen Erscheinungen in festen Körpern - Lenz - 1920
7	Approximating the number of dimer coverings of a lattice - Kenyon, Randall, et al. - 1996