A New Complementation Algorithm
Chen Guang Guo · Journal of Tianjin Normal University · 2001
This paper exposes an underlying unification of the existing complementation algorithms. It is proven that unate complementation and sharp are the same as DeMorgan Law algorithm and disjoint sharp is a special case of the recursive method; it proposes algorithm trees; it gives faster algorithms for finding complements of functions in SOP form based on algorithm trees.