Efficient Parallel Evaluation of Boolean Expressions

DOI10.1109/TC.1976.1674647MaRDI QIDQ4093348zbMATH OpenFDO

Authors David E. Muller, F. P. Preparata

Publication date 1976

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(6)

• On a relation between the depth and complexity of monotone Boolean formulas
• The delay of circuits whose inputs have specified arrival times
• Size-depth tradeoff in non-monotone Boolean formulae
• Parallel restructuring and evaluation of expressions
• Lower bounds on the depth of monotone arithmetic computations
• On the meaning of works by V. M. Khrapchenko

This page was built for publication: Efficient Parallel Evaluation of Boolean Expressions

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