Interpolating Arithmetic Read-Once Formulas in Parallel

DOI10.1137/S009753979528812XzbMath0911.68068OpenAlexW2033625452MaRDI QIDQ4388878

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

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

Related Items (9)

Exact learning from an honest teacher that answers membership queries ⋮ Isomorphism testing of read-once functions and polynomials ⋮ Sums of read-once formulas: how many summands are necessary? ⋮ Sparse multivariate polynomial interpolation on the basis of Schubert polynomials ⋮ Unnamed Item ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Read-once polynomial identity testing ⋮ Sums of Read-Once Formulas: How Many Summands Suffice? ⋮ Characterizing Arithmetic Read-Once Formulae

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