Issue No.05 - May (1976 vol.25)
F.P. Preparata , Coordinated Science Laboratory and the Department of Electrical Engineering, University of Illinois
A Boolean expression wilth n literals, i.e., n distinct appearances of variables, can be evaluated by a parallel processing system in at most 1.81 log2n steps, or, equivalently, by a network constructed with two-input AND and OR gates and having at most 1.81 log2n levels.
Boolean expressions, combinational networks, computational complexity, evaluation of Boolean expressions, parallel computation.
F.P. Preparata, "Efficient Parallel Evaluation of Boolean Expressions", IEEE Transactions on Computers, vol.25, no. 5, pp. 548-549, May 1976, doi:10.1109/TC.1976.1674647