Issue No.11 - November (1978 vol.27)
Y. Breitbart , Department of Computer Science and Electrical Engineering, University of Wisconsin
This correspondence considers the efficiency of some algorithms for the evaluation of monotonic Boolean functions. It is shown that algorithms based on the criterion of maximizing the local information gain about the Boolean function with n variables may sometimes require a number of computational steps which is n/log n times the computational steps of the optimal algorithm.
monotonic, Binary tree, Boolean, function
Y. Breitbart, S. Gal, "Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions", IEEE Transactions on Computers, vol.27, no. 11, pp. 1083-1087, November 1978, doi:10.1109/TC.1978.1675002