A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
2001
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01
Preserved Fulltext
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.
doi:10.1145/380752.380877
dblp:conf/stoc/JerrumSV01
fatcat:6gh23dco4vawraaitbbrcarz3i