Issue No.12 - December (1983 vol.32)
B.M.E. Moret , Department of Computer Science, University of New Mexico
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.
worst-case testing cost, Argument complexity, decision tree, multiplexer tree, threshold function
B.M.E. Moret, M.G. Thomason, R.C. Gonzalez, "Symmetric and Threshold Boolean Functions Are Exhaustive", IEEE Transactions on Computers, vol.32, no. 12, pp. 1211-1212, December 1983, doi:10.1109/TC.1983.1676189