Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Interpolating arithmetic read-once formulas in parallel
Bshouty N., Cleve R. SIAM Journal on Computing27 (2):401-413,1998.Type:Article
Date Reviewed: Aug 1 1999

The authors consider the problem of recovering arithmetic read-once formulas. Such a formula is defined over a set of variables, and the allowed operations are addition, subtraction, division, and multiplication. Each variable can occur only once. Given the values of the variables, an oracle returns the corresponding value of the formulas. Various methods of identifying the formulas are explored, and their efficiencies are analyzed.

This is a technical paper for specialists. The presentation is burdened by many acronyms. The list of references is adequate.

Reviewer:  S.-Å. Gustafson Review #: CR121906 (9908-0645)
Bookmark and Share
 
Rational Approximation (G.1.2 ... )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Rational Approximation": Date
Approximation of nonlinear dynamic systems by rational series
Hespel C., Jacob G. Theoretical Computer Science 79(1): 151-162, 1991. Type: Article
Dec 1 1991
On a rational approximation problem in the real Hardy space H2
Baratchart L., Olivi M., Wielonsky F. Theoretical Computer Science 94(2): 175-197, 1992. Type: Article
Jun 1 1993
Algorithm 766: experiments with a weakly stable algorithm for computing Padé-Hermite and simultaneous Padé approximants
Cabay S., Jones A., Labahn G. ACM Transactions on Mathematical Software 23(1): 91-110, 1997. Type: Article
Sep 1 1997
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy