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

Authors:
Mark Jerrum;Alistair Sinclair;Eric Vigoda
Affiliations:
Division of Informatics, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, United Kingdom;Computer Science Division, Univ. of California, Berkeley, Soda Hall, Berkeley, CA;Division of Informatics, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, United Kingdom
Venue:
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Year:
2001

Citing 7
Cited 34

Random generation of combinatorial structures from a uniform

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

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Approximating the permanent

SIAM Journal on Computing
Fast uniform generation of regular graphs

Theoretical Computer Science
Randomized algorithms

Randomized algorithms
The Markov chain Monte Carlo method: an approach to approximate counting and integration

Approximation algorithms for NP-hard problems
Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor

Random Structures & Algorithms

One-dimensional quantum walks

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Solving convex programs by random walks

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Clifford algebras and approximating the permanent

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Secure Multiparty Computation of Approximations

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Analysis of Absorbing Times of Quantum Walks

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Adiabatic quantum state generation and statistical zero knowledge

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Clifford algebras and approximating the permanent

Journal of Computer and System Sciences - STOC 2002
A determinant-based algorithm for counting perfect matchings in a general graph

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Solving convex programs by random walks

Journal of the ACM (JACM)
Random generation of 2×2×...×2×Jcontingency tables

Theoretical Computer Science
Beyond NP: the work and legacy of Larry Stockmeyer

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximately counting integral flows and cell-bounded contingency tables

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
To do or not to do: the dilemma of disclosing anonymized data

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Coupling with the stationary distribution and improved sampling for colorings and independent sets

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling regular graphs and a peer-to-peer network

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing sparse permanents faster

Information Processing Letters
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics

Computing in Science and Engineering
A polynomial quantum algorithm for approximating the Jones polynomial

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Compression of samplable sources

Computational Complexity
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

Journal of Combinatorial Theory Series B
Simulated Annealing for Convex Optimization

Mathematics of Operations Research
An upper bound for permanents of nonnegative matrices

Journal of Combinatorial Theory Series A
Decoherence in quantum walks – a review

Mathematical Structures in Computer Science
Optimal computation with non-unitary quantum walks

Theoretical Computer Science
On disclosure risk analysis of anonymized itemsets in the presence of prior knowledge

ACM Transactions on Knowledge Discovery from Data (TKDD)
Parimutuel Betting on Permutations

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Solution counting algorithms for constraint-centered search heuristics

Constraints
Computing sparse permanents faster

Information Processing Letters
Multitask learning with expert advice

COLT'07 Proceedings of the 20th annual conference on Learning theory
Solution counting algorithms for constraint-centered search heuristics

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On the number of α-orientations

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Bravely, moderately: a common theme in four recent works

Studies in complexity and cryptography
Fourier-information duality in the identity management problem

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Exact algorithms for exact satisfiability and number of perfect matchings

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fully-polynomial randomized approximation scheme for computing the permanent of an arbitrary matrix with non-negative entries.