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

Authors:
Mark Jerrum;Alistair Sinclair;Eric Vigoda
Affiliations:
University of Edinburgh, Edinburgh, United Kingdom;University of California at Berkeley, Berkeley, California;University of Chicago, Chicago, Illinois
Venue:
Journal of the ACM (JACM)
Year:
2004

Citing 11
Cited 62

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
On the number of Eularian orientations of a graph

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Randomized algorithms

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

Approximation algorithms for NP-hard problems
A Chernoff Bound for Random Walks on Expander Graphs

SIAM Journal on Computing
Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor

Random Structures & Algorithms
Clifford algebras and approximating the permanent

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An O(n2) bound for the relaxation time of a Markov chain on cladograms

Random Structures & Algorithms

Sampling binary contingency tables with a greedy start

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Counting without sampling: new algorithms for enumeration problems using statistical physics

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Accelerating simulated annealing for the permanent and combinatorial counting problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SIGACT news complexity theory column 51

ACM SIGACT News
Secure multiparty computation of approximations

ACM Transactions on Algorithms (TALG)
Mathematical aspects of mixing times in Markov chains

Foundations and Trends® in Theoretical Computer Science
Simple deterministic approximation algorithms for counting matchings

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Negative examples for sequential importance sampling of binary contingency tables

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Rapid mixing of Gibbs sampling on graphs that are sparse on average

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast approximation of the permanent for very dense problems

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fully polynomial time approximation schemes for stochastic dynamic programs

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Enumerating contingency tables via random permanents

Combinatorics, Probability and Computing
Tracking in a spaghetti bowl: monitoring transactions using footprints

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Undirected connectivity in log-space

Journal of the ACM (JACM)
Approximately Counting Embeddings into Random Graphs

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models

Random Structures & Algorithms
A Sequential Algorithm for Generating Random Graphs

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Polytopal Graph Complexity, Matrix Permanents, and Embedding

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Expanders via random spanning trees

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Adaptive simulated annealing: A near-optimal connection between sampling and counting

Journal of the ACM (JACM)
Sampling Eulerian orientations of triangular lattice graphs

Journal of Discrete Algorithms
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Mathematics of Operations Research
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Permanents, transport polytopes and positive definite kernels on histograms

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Counting solutions of CSPs: a structural approach

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Longest common subsequence as private search

Proceedings of the 8th ACM workshop on Privacy in the electronic society
Learning Permutations with Exponential Weights

The Journal of Machine Learning Research
How should we solve search problems privately?

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Non-commutative circuits and the sum-of-squares problem

Proceedings of the forty-second ACM symposium on Theory of computing
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix

Journal of Computer and System Sciences
Liftings of tree-structured Markov chains

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
What is the complexity of a network? the heat flow-thermodynamic depth approach

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs

Theoretical Computer Science
Uniform sampling of digraphs with a fixed degree sequence

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Approximately Counting Integral Flows and Cell-Bounded Contingency Tables

SIAM Journal on Computing
Using markov-chain mixing time estimates for the analysis of ant colony optimization

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
The computational complexity of linear optics

Proceedings of the forty-third annual ACM symposium on Theory of computing
Efficient circuits for quantum walks

Quantum Information & Computation
The computational complexity of estimating MCMC convergence time

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Pseudorandomness and derandomization

XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
Counting perfect matchings as fast as Ryser

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate counting via correlation decay in spin systems

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Computing the partition function for perfect matchings in a hypergraph

Combinatorics, Probability and Computing
An almost linear time approximation algorithm for the permanent of a random (0-1) matrix

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Random bichromatic matchings

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
k-Concealment: An Alternative Model of k-Type Anonymity

Transactions on Data Privacy
Combinatorial bandits

Journal of Computer and System Sciences
Efficient rank aggregation using partial data

Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Constructing and sampling graphs with a prescribed joint degree distribution

Journal of Experimental Algorithmics (JEA)
Approximating the Permanent via Nonabelian Determinants

SIAM Journal on Computing
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions

SIAM Journal on Computing
Multivariate polynomial integration and differentiation are polynomial time inapproximable unless P=NP

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
How to attack the NP-Complete dag realization problem in practice

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Are we there yet? when to stop a markov chain while generating random graphs

WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
The hardness of counting full words compatible with partial words

Journal of Computer and System Sciences
Time hierarchies for sampling distributions

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hitting time of quantum walks with perturbation

Quantum Information Processing
Synthesis and optimization of reversible circuits—a survey

ACM Computing Surveys (CSUR)
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials

Journal of Combinatorial Optimization
Noncommutativity makes determinants hard

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Approximating the permanent with fractional belief propagation

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.01

Visualization

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.