Interpolating Arithmetic Read-Once Formulas in Parallel

DOI10.1137/S009753979528812XMaRDI QIDQ4388878zbMATH OpenOpenAlexFDO

Authors Nader H. Bshouty, Richard Cleve

Publication date 10 May 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s009753979528812x

zbMATH Keywords

learning theoryparallel algorithmread-once formula

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by rational functions (41A20) Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• On interpolating arithmetic read-once formulas with exponentiation
• Fast and parallel interval arithmetic
• Parallel rational interpolation
• Parallel computation of arithmetic expressions involving unary functions
• Publication:3471698
• scientific article; zbMATH DE number 3999284
• An Optimal Parallel Algorithm for Formula Evaluation
• Parallel evaluation of arithmetic circuits
• Very Fast Parallel Polynomial Arithmetic
• Fast Parallel Arithmetic via Modular Representation

Cited in

(12)

• On interpolating arithmetic read-once formulas with exponentiation
• Fast and parallel interval arithmetic
• Sums of read-once formulas: how many summands are necessary?
• Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
• Exact learning from an honest teacher that answers membership queries
• Isomorphism testing of read-once functions and polynomials
• Characterizing arithmetic read-once formulae
• Random arithmetic formulas can be reconstructed efficiently
• Read-once polynomial identity testing
• On some computations on sparse polynomials
• Sums of read-once formulas: how many summands suffice?
• Towards identity testing for sums of products of Read-once and multilinear bounded-Read formulae

This page was built for publication: Interpolating Arithmetic Read-Once Formulas in Parallel

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