|
Organizers |
Optimal representations of 0-1 boolean functions over EXOR, AND and N.
by
I. G. Rosenberg
Math.stat. Universite de Montreal
The minimal representations of 0-1 boolean functions as disjunctive normal forms over OR, AND and N are well studied. If OR is replaced by EXOR (i.e.the sum mod 2) we have a different situation. We present an algorithm based on systems of linear equations over GF(2).
Date received: February 8, 2002
Copyright © 2002 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caht-27.