Abstract:
A problem of implementation of multiple-valued logic functions by special form formulas is considered. For each prime $k$, $k\ne2$, upper exponential estimates of complexity of an arbitrary $k$-valued logic function are obtained.
Key words:function of multiple-valued logic, formula, complexity, depth.
Fulltext:
PDF file (238 kB)