“Interpolating polynomials from their values”
10.1016/s0747-7171(08)80018-1 · doi-reference
“Probably almost discriminative learning”
10.1023/a:1022870506888 · doi-reference
“Testing symmetric properties of distributions”
10.1145/1374376.1374432 · doi-reference
“A theory of the learnable”
10.1145/1968.1972 · doi-reference
“Optimal attribute-efficient learning of disjunction, parity and threshold functions”
10.1007/3-540-62685-9_15 · doi-reference
“Derandomizing homomorphism testing in general groups”
10.1145/1007352.1007421 · doi-reference
“Learning sparse multivariate polynomials over a field with queries and counterexamples”
10.1006/jcss.1996.0017 · doi-reference
“Robust characterization of polynomials with applications to program testing”
10.1137/s0097539793255151 · doi-reference
“Interpolation and approximation of sparse multivariate polynomials over GF(2)”
10.1137/0220019 · doi-reference
“Testing basic Boolean formulae”
10.1137/s0895480101407444 · doi-reference
“Tolerant property testing and distance approximation”
10.1016/j.jcss.2006.03.002 · doi-reference
“On testing convexity and submodularity”
10.1137/s0097539702414026 · doi-reference
“Testing the diameter of graphs”
10.1002/rsa.10013 · doi-reference
“Testing membership in languages that have small width branching programs”
10.1137/s009753970038211x · doi-reference
“Randomized interpolation and approximation of sparse polynomials”
10.1137/s0097539792239291 · doi-reference
“Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm”
10.1023/a:1022869011914 · doi-reference
“On probably correct classification of concepts”
10.1145/168304.168318 · doi-reference
“Active learning using arbitrary binary valued queries”
10.1023/a:1022627018023 · doi-reference
“Boosting and hard-core sets”
10.1109/sffcs.1999.814638 · doi-reference
“Toward efficient agnostic learning”
10.1023/a:1022615600103 · doi-reference
“Cryptographic limitations on learning boolean formulae and finite automata”
10.1145/174644.174647 · doi-reference
“Testing problems with sub-learning sample complexity”
10.1006/jcss.1999.1656 · doi-reference
“Learning Boolean formulae”
10.1145/195613.195656 · doi-reference
“Testing polynomials over general fields”
10.1137/s0097539704445615 · doi-reference
“Tight bounds for testing bipartiteness in general graphs”
10.1137/s0097539703436424 · doi-reference
“Testing low-degree polynomials over prime fields”
10.1109/focs.2004.64 · doi-reference
“An efficient membership-query algorithm for learning DNF with respect to the uniform distribution”
10.1006/jcss.1997.1533 · doi-reference
“A sublinear-time approximation scheme for clustering in metric spaces”
10.1109/sffcs.1999.814587 · doi-reference
“Probability inequalities for sums of bounded random variables”
10.1080/01621459.1963.10500830 · doi-reference
“Distribution-free property testing”
10.1137/050645804 · doi-reference
“Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields”
10.1137/0219073 · doi-reference
“Probabilistic encryption”
10.1016/0022-0000(84)90070-9 · doi-reference
“Three theorems regarding testing graph properties”
10.1002/rsa.10078 · doi-reference
“Property testing in bounded degree graphs”
10.1007/s00453-001-0078-7 · doi-reference
“A sublinear bipartite tester for bounded degree graphs”
10.1007/s004930050060 · doi-reference
“Learning juntas”
10.1016/j.jcss.2004.04.002 · doi-reference
“Property testing and its connection to learning and approximation”
10.1145/285055.285060 · doi-reference
“Testing monotonicity”
10.1007/s004930070011 · doi-reference
“Some improvements to total degree tests”
10.1109/istcs.1995.377032 · doi-reference
“On learning ring-sum expansions”
10.1137/0221014 · doi-reference
