This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions
November 1978 (vol. 27 no. 11)
pp. 1083-1087
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.
Index Terms:
monotonic, Binary tree, Boolean, function
Citation:
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, Nov. 1978, doi:10.1109/TC.1978.1675002
Usage of this product signifies your acceptance of the Terms of Use.