Symmetric and Threshold Boolean Functions Are Exhaustive

Authors:
B. M. E. Moret;M. G. Thomason;R. C. Gonzalez
Affiliations:
Department of Computer Science, University of New Mexico;-;-
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 2
Cited 0

Decision Trees and Diagrams

ACM Computing Surveys (CSUR)
Synthesis of Minimal Binary Decision Trees

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

The worst-case number of variable evaluations (testing cost) of Boolean functions is examined. Following up on a result by Rivest and Vuillemin, we show that all symmetric as well as all linearly separable Boolean functions are exhaustive, that is, have a pessimal worst-case testing cost.