A compact method for the minimisation of boolean polynomials
J. M. Wilson · International Journal of Computer Mathematics · 1982
An algorithm for minimising Boolean polynomials is developed. The algorithm can be programmed conveniently and although it makes use of existing knowledge of minimising methods, the algorithm is novel in that it involves no expansion of the number of terms of the polynomial other than by one term which is dropped before the next stage of the algorithm is reached