Affiliation:
1. Computer Centre, Australian Nalional University, P.O. Box 4, Canberra, A.C.T. 2600, Australia
Abstract
It is shown that arithmetic expressions with
n
≥ 1 variables and constants; operations of addition, multiplication, and division; and any depth of parenthesis nesting can be evaluated in time 4 log
2
n
+ 10(
n
- 1)/
p
using
p
≥ 1 processors which can independently perform arithmetic operations in unit time. This bound is within a constant factor of the best possible. A sharper result is given for expressions without the division operation, and the question of numerical stability is discussed.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
543 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parallel Dynamic Maximal Matching;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
3. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
4. Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10