Time Bounds on the Parallel Evaluation of Arithmetic Expressions
From MaRDI portal
Publication:4060388
Cited in
(5)- A new algorithm for parallel solution of linear equations
- Parallel restructuring and evaluation of expressions
- Bounds on the parallel evaluation of arithmetic expressions using associativity and commutativity
- The time required to evaluate division-free arithmetic expressions
- Lower bounds on the depth of monotone arithmetic computations
This page was built for publication: Time Bounds on the Parallel Evaluation of Arithmetic Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060388)