The time required to evaluate division-free arithmetic expressions

DOI10.1016/0020-0190(75)90028-9zbMath0339.68041OpenAlexW1963738961MaRDI QIDQ1231389

David E. Muller, Franco P. Preparata

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90028-9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (2)

On a relation between the depth and complexity of monotone Boolean formulas ⋮ On the parallel evaluation of division-free arithmetic expressions with fan-in of three

Cites Work

• Time Bounds on the Parallel Evaluation of Arithmetic Expressions
• On the Parallel Evaluation of Certain Arithmetic Expressions
• The Parallel Evaluation of General Arithmetic Expressions
• The Parallel Evaluation of Arithmetic Expressions Without Division

This page was built for publication: The time required to evaluate division-free arithmetic expressions