The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Property testing and its connection to learning and approximation
Open accessAbstract
In this paper, we consider the question of determining whether a function f has property P or is ε-far from any function with property P. A property testing algorithm is given a sample of the value of f on instances drawn according to some distribution. In some cases, it is also allowed to query f on instances of its choice. We study this question for different properties and establish some connections to problems in learning theory and approximation. In particular, we focus our attention on testing graph properties. Given access to a graph G in the form of being able to query whether an edge exists or not between a pair of vertices, we devise algorithms to test whether the underlying graph has properties such as being bipartite, k -Colorable, or having a p -Clique (clique of density p with respect to the vertex set). Our graph property testing algorithms are probabilistic and make assertions that are correct with high probability, while making a number of queries that is independent of the size of the graph. Moreover, the property testing algorithms can be used to efficiently (i.e., in time linear in the number of vertices) construct partitions of the graph that correspond to the property being tested, if it holds for the input graph.
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
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Schwartz, J. T. (1980) · Journal of the ACM · doi:10.1145/322217.322225 · Cited by 1,701
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
Robust Characterizations of Polynomials with Applications to Program Testing
Rubinfeld, R., & Sudan, M. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793255151 · Cited by 794
Using dual approximation algorithms for scheduling problems theoretical and practical results
Hochbaum, D. S., & Shmoys, D. B. (1987) · Journal of the ACM · doi:10.1145/7531.7535 · Cited by 790
Complexity of automaton identification from given data
Gold, E. M. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90562-4 · Cited by 771
Self-testing/correcting with applications to numerical problems
Blum, M., Luby, M., & Rubinfeld, R. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90044-w · Cited by 712
Checking computations in polylogarithmic time
Babai, L., Fortnow, L., Levin, L. A., & Szegedy, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103428 · Cited by 616
Small-Bias Probability Spaces: Efficient Constructions and Applications
Naor, J., & Naor, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222053 · Cited by 560
Simple Constructions of Almost k‐wise Independent Random Variables
Alon, N., Goldreich, O., Håstad, J., & Peralta, R. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030308 · Cited by 556
Self-citationAdaptively secure multi-party computation
Canetti, R., Feige, U., Goldreich, O., & Naor, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.238015 · Cited by 548
Self-citationNon-deterministic exponential time has two-prover interactive protocols
Babai, L., Fortnow, L., & Lund, C. (1992) · Computational Complexity · doi:10.1007/bf01200430 · Cited by 520
Computational limitations on learning from examples
Pitt, L., & Valiant, L. G. (1988) · Journal of the ACM · doi:10.1145/48014.63140 · Cited by 515
Non-deterministic exponential time has two-prover interactive protocols
Babai, L., Fortnow, L., & Lund, C. (1991) · Computational Complexity · doi:10.1007/bf01200056 · Cited by 458
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
Bellare, M., Goldreich, O., & Sudan, M. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539796302531 · Cited by 453
Self-citationGeometric Algorithms and Combinatorial Optimization
Leung, J. M. Y., Grötschel, M., Lovász, L., & Schrijver, A. (1989) · Journal of the Operational Research Society · doi:10.2307/2583689 · Cited by 435
Approximate graph coloring by semidefinite programming
Karger, D., Motwani, R., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/274787.274791 · Cited by 420
Approximating clique is almost NP-complete
Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szegedy, M. (2002) · [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · doi:10.1109/sfcs.1991.185341 · Cited by 396
Self-citationToward efficient agnostic learning
Kearns, M. J., Schapire, R. E., & Sellie, L. M. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130424 · Cited by 330
Efficient probabilistically checkable proofs and applications to approximations
Bellare, M., Goldwasser, S., Lund, C., et al. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167174 · Cited by 317
Self-citationThe 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
On the learnability of discrete distributions
Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195155 · Cited by 273
Self-citationFree bits, PCPs and non-approximability-towards tight results
Bellare, M., Goldreich, O., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492573 · Cited by 265
Self-citationOn the complexity of minimum inference of regular sets
Angluin, D. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90683-6 · Cited by 251
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
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Arora, S., Karger, D., & Karpinski, M. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1605 · Cited by 199
The hardness of approximation: Gap location
Petrank, E. (1994) · Computational Complexity · doi:10.1007/bf01202286 · Cited by 196
Self-testing/correcting for polynomials and for approximate functions
Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., & Wigderson, A. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103429 · Cited by 181
On recognizing graph properties from adjacency matrices
Rivest, R. L., & Vuillemin, J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90053-0 · Cited by 177
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
Improved non-approximability results
Bellare, M., & Sudan, M. (1994) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/195058.195129 · Cited by 162
The minimum consistent DFA problem cannot be approximated within any polynomial
Pitt, L., & Warmuth, M. K. (1993) · Journal of the ACM · doi:10.1145/138027.138042 · Cited by 153
Property testing in bounded degree graphs
Goldreich, O., & Ron, D. (1997) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/258533.258627 · Cited by 133
Self-citationApproximate graph coloring by semidefinite programming
Karger, D. R., Motwani, R., & Sudan, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365710 · Cited by 106
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
MAX-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
Ergün, F., Kannan, S., Kumar, S. R., Rubinfeld, R., & Viswanathan, M. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276757 · Cited by 58
Testing Problems with Sublearning Sample Complexity
Kearns, M. J., & Ron, D. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1656 · Cited by 48
Self-citationLower bounds to randomized algorithms for graph properties
Yao, A. C.-C. (1987) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1987.39 · Cited by 31
A sublinear bipartiteness tester for bounded degree graphs
Goldreich, O., & Ron, D. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276767 · Cited by 30
Self-citationLinearity testing in characteristic two
Mihir Bellare, Y., Coppersmith, D., Håstad, J., Kiwi, M. A., & Sudan, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492574 · Cited by 30
Recycling queries in PCPs and in linearity tests (extended abstract)
Trevisan, L. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276769 · Cited by 27
Testing problems with sub-learning sample complexity
Kearns, M. J., & Ron, D. (1998) · Conference on Learning Theory · doi:10.1145/279943.279996 · Cited by 15
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
Bansal, N., Blum, A., & Chawla, S. (2004) · Machine Learning · doi:10.1023/b:mach.0000033116.57574.95 · Cited by 1,075
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
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
Introduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
Self-citationThe Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155
Metadata
- Authors
- Goldreich, O., Goldwasser, S., & Ron, D.
- Venue
- Journal of the ACM
- Published
- 1998-07
- Volume
- 45
- Issue
- 4
- Pages
- 653-750
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1970630090
- Cited by
- 1,020
- References
- 51
- FWCI
- 18.58
- 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
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.