The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A random polynomial-time algorithm for approximating the volume of convex bodies
Open accessAbstract
A randomized polynomial-time algorithm for approximating the volume of a convex body K in n -dimensional Euclidean space is presented. The proof of correctness of the algorithm relies on recent theory of rapidly mixing Markov chains and isoperimetric inequalities to show that a certain random walk can be used to sample nearly uniformly from within K .
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Elliptic Partial Differential Equations of Second Order
Gilbarg, D., & Trudinger, N. S. (2001) · Classics in Mathematics · doi:10.1007/978-3-642-61798-0 · Cited by 18,587
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
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
Asymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/bfb0075912 · Cited by 778
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Random walks on finite groups and rapidly mixing markov chains
Aldous, D. (1983) · Lecture notes in mathematics · doi:10.1007/bfb0068322 · Cited by 450
An Algorithmic Theory of Numbers, Graphs and Convexity
Lovász, L. (1986) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970203 · Cited by 358
Monte-Carlo algorithms for enumeration and reliability problems
Karp, R. M., & Luby, M. G. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.35 · Cited by 320
Cited by
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
The Cross-Entropy Method for Combinatorial and Continuous Optimization
Rubinstein, R. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010091220143 · Cited by 903
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-012-9135-7 · Cited by 886
Metadata
- Authors
- Dyer, M., Frieze, A., & Kannan, R.
- Venue
- Journal of the ACM
- Published
- 1991-01-03
- Volume
- 38
- Issue
- 1
- Pages
- 1-17
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2063342497
- Cited by
- 693
- References
- 13
- FWCI
- 29.73
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A random polynomial-time algorithm for approximating the volume of convex bodies. https://app.cochat.ai/papers/10.1145/102782.102783
- The paper
- Dyer, M., Frieze, A., & Kannan, R. (1991). A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM. https://doi.org/10.1145/102782.102783
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.