Journal
Scientific and technical journal «Priborostroenie»
UDK62-507.15
Issue:7 (65)
Download PDF450 Kbyte
A method for evaluating the complexity of arbitrary function of Boolean algebra is examined, based on presenting such a function as a composition of monotone functions. Accurate upper estimates have been received for the complexity of monotone and arbitrary functions depending on a small number of variables.