A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Interpolation and approximation of sparse multivariate polynomials over GF(2)
SIAM Journal on Computing
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
Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Testing polynomials which are easy to compute (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolationover Finite Fields
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolationover Finite Fields
Discovering admissible models of complex systems based on scale-types and identity constraints
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
| Hi-index | 0.00 |
A formula is a read-once formula if each variable appears at most once in it. An arithmetic read-once formula (AROF) with exponentiation is one in which the operations are addition, subtraction, multiplication, division and exponentiation to an arbitrary integer. We present a polynomial time algorithm for interpolating AROF with exponentiation using randomized substitutions. We then nonconstructively show the existence of a nonuniform deterministic algorithm.Interpolating AROF without exponentiation is studied in [Bshouty, Hancock and Hellerstein, STOC 92]. To add the exponentiation operation to the basis we develop a new technique.