Optimal sequential arrangement of evaluation trees for boolean functions

Y. Perl, Y. Breitbart

Research output: Contribution to journalArticle

5 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1-12
Number of pages12
JournalInformation sciences
Volume11
Issue number1
DOIs
StatePublished - 1976
Externally publishedYes

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems and Management
  • Artificial Intelligence
  • Theoretical Computer Science
  • Control and Systems Engineering
  • Computer Science Applications

Cite this