The Complexity of Trie Index Construction
Journal of the ACM (JACM)
An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs
IEEE Transactions on Computers
MINI: a heuristic approach for logic minimization
IBM Journal of Research and Development
On the Size of PLAs Required to Realize Binary and Multiple-Valued Functions
IEEE Transactions on Computers
| Hi-index | 15.00 |
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.