On interpolating arithmetic read-once formulas with exponentiation

DOI10.1006/JCSS.1997.1550MaRDI QIDQ1267719zbMATH OpenOpenAlexFDO

Authors Daoud Bshouty, Nader H. 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

zbMATH Keywords

arithmetic read-once formula

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Interpolating Arithmetic Read-Once Formulas in Parallel
• Learning Arithmetic Read-Once Formulas
• Characterizing arithmetic read-once formulae

Cites work

• scientific article; zbMATH DE number 3759547 (Why is no real title available?)
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Factoring polynomials with rational coefficients
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
• Learning Arithmetic Read-Once Formulas
• On the decidability of sparse univariate polynomial interpolation
• Randomized Interpolation and Approximation of Sparse Polynomials

Cited in

(10)

• Characterizing arithmetic read-once formulae
• Exact learning from an honest teacher that answers membership queries
• On the Expressive Power of Read-Once Determinants
• Interpolating Arithmetic Read-Once Formulas in Parallel
• On some computations on sparse polynomials
• Learning Arithmetic Read-Once Formulas
• Read-once polynomial identity testing
• Sums of read-once formulas: how many summands are necessary?
• Sums of read-once formulas: how many summands suffice?
• Efficient learning algorithms yield circuit lower bounds

This page was built for publication: On interpolating arithmetic read-once formulas with exponentiation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267719)