The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
The statistics of dimers on a lattice
Kasteleyn, P. W. (1961) · Physica · doi:10.1016/0031-8914(61)90063-5 · Cited by 1,258
Random generation of combinatorial structures from a uniform distribution
Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 985
Self-citationRyser, H. (1963) · Carus Mathematical Monographs · doi:10.5948/upo9781614440147 · Cited by 969
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Self-citationImproved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Sinclair, A. (1992) · Combinatorics, Probability and Computing · doi:10.1017/s0963548300000390 · Cited by 498
Self-citationThe Markov chain Monte Carlo method: an approach to approximate counting and integration
Jerrum, M., & Sinclair, A. (1996) · Cited by 489
Self-citationComparison Theorems for Reversible Markov Chains
Diaconis, P., & Saloff-Coste, L. (1993) · The Annals of Applied Probability · doi:10.1214/aoap/1177005359 · Cited by 423
How hard is it to marry at random? (On the approximation of the permanent)
Broder, A. Z. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12136 · Cited by 173
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
Linial, N., Samorodnitsky, A., & Wigderson, A. (2000) · COMBINATORICA · doi:10.1007/s004930070007 · Cited by 143
Chernoff-type bound for finite Markov chains
Lezaud, P. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1028903453 · Cited by 137
Aldous, D. (1987) · Probability in the Engineering and Informational Sciences · doi:10.1017/s0269964800000267 · Cited by 133
Fast uniform generation of regular graphs
Jerrum, M., & Sinclair, A. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90164-d · Cited by 118
Self-citationOn the Number of Eulerian Orientations of a Graph
Mihail, M., & Winkler, P. (1996) · Algorithmica · doi:10.1007/bf01940872 · Cited by 97
Approximating the number of monomer-dimer coverings of a lattice
Mathieu, C., Randall, D., & Sinclair, A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02183743 · Cited by 81
Self-citationA deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Linial, N., Samorodnitsky, A., & Wigderson, A. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276880 · Cited by 67
A Mildly Exponential Approximation Algorithm for the Permanent
Jerrum, M., & Vazirani, U. V. (1996) · Algorithmica · doi:10.1007/bf01940871 · Cited by 37
Self-citation
Cited by
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
(2003) · Cited by 1,680
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Comparing molecules and solids across structural and alchemical space
De, S., Bartók, A. P., Csányi, G., & Ceriotti, M. (2016) · Physical Chemistry Chemical Physics · doi:10.1039/c6cp00415f · Cited by 778
Metadata
- Authors
- Jerrum, M., Sinclair, A., & Vigoda, E.
- Venue
- Journal of the ACM
- Published
- 2004-07
- Volume
- 51
- Issue
- 4
- Pages
- 671-697
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W226703363
- Cited by
- 792
- References
- 19
- FWCI
- 24.68
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.