Efficient Parallel Evaluation of Boolean Expressions

DOI10.1109/TC.1976.1674647zbMath0327.94046MaRDI QIDQ4093348

David E. Muller, Franco 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)

Related Items (6)

The delay of circuits whose inputs have specified arrival times ⋮ On a relation between the depth and complexity of monotone Boolean formulas ⋮ Size-depth tradeoff in non-monotone Boolean formulae ⋮ Parallel restructuring and evaluation of expressions ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ Lower bounds on the depth of monotone arithmetic computations

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