Study of the complexity of an algorithm to derive the complement of a binary function
Juan Manuel Sánchez, J. BALLESTEROS, A. Vaquero · International Journal of Electronics · 1989
To synthesize combinational logic, programmable logic arrays (PLAs) may be used. Most programs for logical PLA optimization need to derive the complement of a Boolean function. In this paper we analyse the complexity of one of these algorithms and, later, we compare the upper bound of the algorithm with experimental results.