Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions

Authors:
Y. Breitbart;S. Gal
Affiliations:
Department of Computer Science and Electrical Engineering, University of Wisconsin;-
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 2
Cited 0

Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time

Journal of the ACM (JACM)
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.