Restructuring of Arithmetic Expressions For Parallel Evaluation

DOI10.1145/321958.321973MaRDI QIDQ4102726zbMATH OpenOpenAlexWikidataFDO

Authors David E. Muller, F. P. Preparata

Publication date 1976

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2142/73942

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)

Cited in

(9)

• Irreducibility of multivariate polynomials
• Size-depth tradeoff in non-monotone Boolean formulae
• Parallel restructuring and evaluation of expressions
• Lower bounds on the depth of monotone arithmetic computations
• The delay of circuits whose inputs have specified arrival times
• A duality between Boolean functions
• On the depth complexity of formulas
• On a relation between the depth and complexity of monotone Boolean formulas
• A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant

This page was built for publication: Restructuring of Arithmetic Expressions For Parallel Evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4102726)