This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.5th International Workshop on Applications of Reed-Muller Expansion in Circuit Design (RM), Starkville, MS, August 2001, pp. 82-93In this paper, 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 O (n to the 3rd) time and uses O (n to the 3rd) storage space. We demonstrate this algorithm on benchmark functions, and we extend it to multi-output functions
