Optimal sequential arrangement of evaluation trees for boolean functions

Abstract

Let F be a disjunction of boolean functions of pairwise disjoint variables. Suppose an evaluation tree is given for each such function. We consider the problem of finding an optimal sequential order of scanning the trees for evaluation of F. A necessary and sufficient condition is given.

A more general arrangement—a tree—structured arrangement of the trees is considered. It is shown to give no improvement.