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.
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
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
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
Randomized Algorithms for Matrices and Data
MAHONEY, M. (2012) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/b11822-37 · Cited by 409
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Self-citationIntroduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
A Randomized Algorithm for the Approximation of Matrices
Martinsson, P.-G., Rockhlin, V., & Tygert, M. (2006) · doi:10.21236/ada458932 · Cited by 268
Energy Minimization via Graph Cuts: Settling What is Possible
Freedman, D., & Drineas, P. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.143 · Cited by 173
“[17] and [18] examined the regularity properties of dense graphs and developed a new method to approximate matrices; this led to a PTAS for dense instances of all Max-2-CSP, and more generally for dense instances of all Max-r-CSP, problems, assuming that all entries in the A’s are Ω(Wmax).”
Method
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.