The Parallel Evaluation of Arithmetic Expressions Without Division

DOI10.1109/T-C.1973.223757zbMath0252.68028OpenAlexW2085992581MaRDI QIDQ5666165

Kiyoshi Maruyama, Richard P. Brent, David Kuck

Publication date: 1973

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1973.223757

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (13)

The delay of circuits whose inputs have specified arrival times ⋮ Some parallel methods for polynomial root-finding ⋮ A quasi-polynomial-time algorithm for sampling words from a context-free language ⋮ On a relation between the depth and complexity of monotone Boolean formulas ⋮ Size-depth tradeoff in non-monotone Boolean formulae ⋮ Parallelizable algebras ⋮ Parameterized random complexity ⋮ On the computational complexity of coalitional resource games ⋮ Parallel restructuring and evaluation of expressions ⋮ Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity ⋮ On the parallel evaluation of division-free arithmetic expressions with fan-in of three ⋮ The time required to evaluate division-free arithmetic expressions ⋮ Lower bounds on the depth of monotone arithmetic computations

This page was built for publication: The Parallel Evaluation of Arithmetic Expressions Without Division