Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
- 1 February 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (2), 212-214
- https://doi.org/10.1109/tc.1987.1676883
Abstract
An algorithm to minimize decision trees of Boolean functions with multiple-valued inputs is presented. The recursive algorithm is used to obtain a complement of a sum-of-products expression for a binary function with multiple-valued inputs. In the case where each input is p-valued, the algorithm produces at most pn−l products for n-variable functions, whereas Sasao's algorithm produces pn/2 products. This upper bound on the number of products is the best possible.Keywords
This publication has 6 references indexed in Scilit:
- An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued InputsIEEE Transactions on Computers, 1985
- The Complexity of Trie Index ConstructionJournal of the ACM, 1977
- Constructing optimal binary decision trees is NP-completeInformation Processing Letters, 1976
- MINI: A Heuristic Approach for Logic MinimizationIBM Journal of Research and Development, 1974
- On Complementation of Boolean FunctionsIEEE Transactions on Computers, 1972
- The problem of simplifying logical expressionsThe Journal of Symbolic Logic, 1959