Optimal sequential arrangement of evaluation trees for Boolean functions

DOI10.1016/0020-0255(76)90033-5zbMath0339.94018OpenAlexW1989053109MaRDI QIDQ1231473

K. Appert

Publication date: 1976

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(76)90033-5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Combinatorial probability (60C05)

Cites Work

• Algorithms for fast evaluation of Boolean expressions
• In which order are different conditions to be examined?
• An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions

This page was built for publication: Optimal sequential arrangement of evaluation trees for Boolean functions