On Mod-2 Sums of Products
- 1 October 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-18 (10) , 957
- https://doi.org/10.1109/T-C.1969.222553
Abstract
An algorithm is provided for obtaining any Boolean function as a modulo-2 sum of products containing only uncomplemented variables. The proofs, which verify the algorithm and show the uniqueness of the results, are simple and free of special mathematical notation.Keywords
This publication has 0 references indexed in Scilit: