Algorithm for Minimal Polarized Polynomial Form Determination

Boolean difference when considering the polarized polynomial forms (AND–EXCLUSIVE OR forms in which each variable in all terms is complemented or uncomplemented) is used in this correspondence. Algorithms for determining quasi-minimnal and minimal polarized forms of the given functions are described.