ABSTRACT
In the previous chapters, the SOP form and its dual equivalent, the POS form, of a Boolean function have been the focus of interest. The SOP forms were the data structures most often used for Boolean function representation during the 40’s and 50’s, when the first generation of computers was developed. Progress in computation methods dates from the beginning of the 70’s, stimulated by the study of alternatives to the SOP forms (details are given in the section “Further study”). This study resulted in the development of so-called polynomial forms of Boolean functions (Figure 10.1). An arbitrary Boolean function can be represented in polynomial forms.
