Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

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

Download PDF
27 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-polynomial-time-approximation-algorithm-for-the-permanent-of-a-qVbxB3wfsB

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2004 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/1008731.1008738
Publisher site
See Article on Publisher Site

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.

Journal

Journal of the ACM (JACM) – Association for Computing Machinery

Published: Jul 1, 2004

References

  • On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing
    Aldous D.