A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
- 1 January 1975
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 4 (4) , 311-319
- https://doi.org/10.1007/bf00289614
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Algorithms for fast evaluation of Boolean expressionsActa Informatica, 1975
- Chow Parameters in Threshold LogicJournal of the ACM, 1971
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing TimeJournal of the ACM, 1966