Efficient Parallel Evaluation of Boolean Expressions

  • Authors:

  • F. P. Preparata;D. E. Muller

  • Affiliations:

  • Coordinated Science Laboratory and the Department of Electrical Engineering, University of Illinois;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1976

Quantified Score

Hi-index 14.98

Visualization

Abstract

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.