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

  title={A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries},
  author={Mark Jerrum and Alistair Sinclair and Eric Vigoda},
  journal={Electron. Colloquium Comput. Complex.},
We present a fully-polynomial randomized approximation scheme for computing the permanent of an arbitrary matrix with non-negative entries. 

Figures from this paper

An asymptotic approximation for the permanent of a doubly stochastic matrix

A determinantal approximation is obtained for the permanent of a doubly stochastic matrix. For moderate-deviation matrix sequences, the asymptotic relative error is of order O(n−1).

FPRAS for computing a lower bound for weighted matching polynomial of graphs

We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete

Probability and Computation

  • S. Kijima
  • Mathematics
    2011 Second International Conference on Networking and Computing
  • 2011
This note reviews some randomized algorithms which the author has been concerned with, having been motivated by the above question.

Random path method with pivoting for computing permanents of matrices

A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs

We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided by a suitable

Approximating the Permanent in O ∗ ( n 7 ) Time

The first polynomial-time algorithm to approximate (with arbitrary precision) the permanent of a non-negative matrix was presented by Jerrum, Sinclair and Vigoda, and a O∗(n7) time algorithm is presented.

A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary

We present a deterministic polynomial-time algorithm that computes the mixed discriminant of an n -tuple of positive semidefinite matrices to within an exponential multiplicative factor. To this end

Solving convex programs by random walks

A simple new algorithm for convex optimization based on sampling by a random walk is presented, which extends naturally to minimizing quasi-convex functions and to other generalizations.

An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix

The algorithm with inputs A, ∈ > 0 produces an output X A with (1-∈)per(A) 0, and almost all (0-1) matrices the algorithm runs in time O(n 2 ω), i.e., almost linear in the size of the matrix.

On the algebraic complexity of some families of coloured Tutte polynomials




A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents

This work develops the first strongly polynomial-time algorithm for matrix scaling –– an important nonlinear optimization problem with many applications and suggests a simple new (slow)Polynomial time decision algorithm for bipartite perfect matching.

A mildly exponential approximation algorithm for the permanent

  • M. JerrumU. Vazirani
  • Computer Science
    Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
A new approximation algorithm for the permanent of ann ×n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n1/2 log2n)). Asymptotically, this represents a

The Complexity of Computing the Permanent

  • L. Valiant
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1979

A Short Proof of the Factor Theorem for Finite Graphs

  • W. T. Tutte
  • Mathematics
    Canadian Journal of Mathematics
  • 1954
We define a graph as a set V of objects called vertices together with a set E of objects called edges, the two sets having no common element. With each edge there are associated just two vertices,

Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor

  • A. Barvinok
  • Mathematics, Computer Science
    Random Struct. Algorithms
  • 1999
We present real, complex, and quaternionic versions of a simple randomized polynomial time algorithm to approximate the permanent of a nonnegative matrix and, more generally, the mixed discriminant

Approximating the Permanent

A randomised approximation scheme for the permanent of a 0–1s presented, demonstrating that the matchings chain is rapidly mixing, apparently the first such result for a Markov chain with genuinely c...

Fast Uniform Generation of Regular Graphs

How hard is it to marry at random? (On the approximation of the permanent)

Al though finding a perfect matching is easy and finding a Hamil tonian circuit is hard, counting perfect matchings and counting Hamiltonian circuits is equally hard, as hard as computing the number of solutions of any problem in NP.

The Probabilistic Method

A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.

The Statistics of Dimers on a Lattice

The number of ways in which a finite quadratic lattice (with edges or with periodic boundary conditions) can be fully covered with given numbers of “horizontal” and “vertical” dimers is rigorously