The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Quick Approximation to Matrices and Applications
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
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
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Optimization, approximation, and complexity classes
Papadimitriou, C. H., & Yannakakis, M. (1991) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(91)90023-x · Cited by 1,653
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Proof verification and hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267823 · Cited by 741
The Algorithmic Aspects of the Regularity Lemma
Alon, N., Duke, R. A., Lefmann, H., Rodl, V., & Yuster, R. (1994) · Journal of Algorithms · doi:10.1006/jagm.1994.1005 · Cited by 305
Polynomial time approximation schemes for dense instances of NP-hard problems
Arora, S., Karger, D., & Karpinski, M. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225140 · Cited by 199
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
The regularity lemma and approximation schemes for dense problems
Frieze, A., & Kannan, R. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548459 · Cited by 170
Self-citationA Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
Duke, R. A., Lefmann, H., & Rödl, V. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539793247634 · Cited by 102
Property testing and its connection to learning and approximation
Goldreich, O., Goldwasser, S., & Ron, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548493 · Cited by 88
Arora, S., FRIEZE, A. M., & Kaplan, H. Y. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548460 · Cited by 80
Self-citationMAX-CUT has a randomized approximation scheme in dense graphs
de la Véga, W. F. (1996) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199605)8:3<187::aid-rsa3>3.0.co;2-u · Cited by 78
Approximately counting Hamilton cycles in dense graphs
Dyer, M., FRIEZE, A. M., & Jerrum, M. (1994) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.5555/314464.314557 · Cited by 20
Self-citationPolynomial time randomised approximation schemes for the Tutte polynomial of dense graphs
Alon, N., FRIEZE, A. M., & Welsh, D. J. A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365708 · Cited by 13
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
Spectral grouping using the nystrom method
Fowlkes, C., Belongie, S., Chung, F., & Malik, J. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262185 · Cited by 1,328
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T., & Vesztergombi, K. (2008) · Advances in Mathematics · doi:10.1016/j.aim.2008.07.008 · Cited by 590
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
Kashtan, N., Itzkovitz, S., Milo, R., & Alon, U. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth163 · Cited by 537
Fast monte-carlo algorithms for finding low-rank approximations
Frieze, A., Kannan, R., & Vempala, S. (2004) · Journal of the ACM · doi:10.1145/1039488.1039494 · Cited by 500
Self-citationA Randomized Algorithm for Principal Component Analysis
Rokhlin, V., Szlam, A., & Tygert, M. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/080736417 · Cited by 422
Metadata
- Authors
- Frieze, A., & Kannan, R.
- Venue
- Combinatorica
- Published
- 1999-02-01
- Volume
- 19
- Issue
- 2
- Pages
- 175-220
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W2072858942
- Cited by
- 502
- References
- 16
- FWCI
- 12.38
- 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.