On interpolating arithmetic read-once formulas with exponentiation
From MaRDI portal
Publication:1267719
DOI10.1006/jcss.1997.1550zbMath0918.68035OpenAlexW2094893810MaRDI QIDQ1267719
Nader H. Bshouty, Daoud Bshouty
Publication date: 17 August 1999
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1550
Related Items (7)
Exact learning from an honest teacher that answers membership queries ⋮ Sums of read-once formulas: how many summands are necessary? ⋮ Unnamed Item ⋮ Read-once polynomial identity testing ⋮ Sums of Read-Once Formulas: How Many Summands Suffice? ⋮ Efficient learning algorithms yield circuit lower bounds ⋮ Characterizing Arithmetic Read-Once Formulae
Cites Work
- Unnamed Item
- On the decidability of sparse univariate polynomial interpolation
- Factoring polynomials with rational coefficients
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Randomized Interpolation and Approximation of Sparse Polynomials
- Learning Arithmetic Read-Once Formulas
This page was built for publication: On interpolating arithmetic read-once formulas with exponentiation
