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

@article{Jerrum2004APA,
  title={A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries},
  author={M. Jerrum and A. Sinclair and Eric Vigoda},
  journal={J. ACM},
  year={2004},
  volume={51},
  pages={671-697}
}
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. 
A remark on approximating permanents of positive definite matrices.
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
A Tight Analysis of Bethe Approximation for Permanent
  • Nima Anari, A. Rezaei
  • Mathematics, Computer Science
  • 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2019
A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications
  • L. Gurvits
  • Computer Science, Mathematics
  • Inf. Comput.
  • 2013
Approximating the Permanent of a Random Matrix with Vanishing Mean
  • Lior Eldar, S. Mehraban
  • Mathematics, Computer Science
  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
...
1
2
3
4
5
...