A method to find the best mixed polarity Reed-Muller expansion.

摘要

In this thesis, we use the transeunt triangle in an efficient algorithm to find the minimum mixed polarity Reed-Muller expression of a given function. This algorithm runs in Θ(n23 n) time and uses Θ(n3 n) storage space. The algorithm is also designed for multiple output functions. Efficiency of this algorithm is demonstrated on benchmark functions.