Learning arithmetic read-once formulas
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Learning sparse multivariate polynomials over a field with queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On learning arithmetic read-once formulas with exponentiation (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
A note on learning multivariate polynomials under the uniform distribution (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Spectral-Null Codes and Null Spaces of Hadamard Submatrices
Designs, Codes and Cryptography
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The query complexity of finding local minima in the lattice
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On feasible multivariate polynomial interpolations over arbitrary fields
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
The query complexity of finding local minima in the lattice
Information and Computation
Adaptive Versus Nonadaptive Attribute-Efficient Learning
Machine Learning
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
IEEE Transactions on Computers
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primality and identity testing via Chinese remaindering
Journal of the ACM (JACM)
Primality and Identity Testing via Chinese Remaindering
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Reed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Design Verification by Test Vectors and Arithmetic Transform Universal Test Set
IEEE Transactions on Computers
On reducing a system of equations to a single equation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
DNF are teachable in the average case
Machine Learning
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
DNF are teachable in the average case
COLT'06 Proceedings of the 19th annual conference on Learning Theory
| Hi-index | 0.01 |