New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
From MaRDI portal
Publication:4088200
DOI10.1145/321941.321945zbMath0324.65017OpenAlexW1972815797MaRDI QIDQ4088200
Publication date: 1976
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321941.321945
Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Computation of special functions and constants, construction of tables (65D20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to approximations and expansions (41-04)
Related Items
Irreducibility of multivariate polynomials, Incomplete partial fractions for parallel evaluation of rational matrix functions, Feasible arithmetic computations: Valiant's hypothesis, A new complexity bound for the least-squares problem, Parallel models of computation: An introductory survey, Fast computation of divided differences and parallel Hermite interpolation, Lower bounds for arithmetic networks, On the parallel complexity of the polynomial ideal membership problem, A new upper bound on the complexity of derivative evaluation, Graph algorithms on a tree-structured parallel computer
