A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
From MaRDI portal
Publication:1225604
DOI10.1007/BF00289614zbMath0326.02009OpenAlexW2063412216MaRDI QIDQ1225604
Publication date: 1975
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289614
Classical propositional logic (03B05) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Related Items
Sequential testing of complex systems: a review, Optimization and analysis of decision trees and rules: dynamic programming approach, Algorithms for fast evaluation of Boolean expressions, Fast sequential evaluation of monotonic Boolean functions, Testing systems of identical components
Cites Work