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

### Cached

### Download Links

- [www-static.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cc.gatech.edu]
- [www.cs.berkeley.edu]
- [www.cs.berkeley.edu]
- [ftp.eccc.uni-trier.de]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of the ACM |

Citations: | 318 - 23 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

### 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