Abstract:
This article addresses the problem of minimizing multioperations in a class
of key standard forms. The work is based on the developed algorithm for
minimizing multi-operations for $n = 2$ and $n = 3$. Using the developed algorithm,
all minimal representations of multioperations for $n = 2$ and $n = 3$, the average
complexity of the minimal representation of multiopearions and the quantitative
distribution of multioperations by the minimal complexity of the obtained minimal
representation in the class of key standard forms are obtained. The obtained results
of minimizing multioperations in the class of key standard forms are compared
with the minimization of multioperations in the class of standard forms.
|
