No label defined (Q4029624)

[For the entire collection see Zbl 0745.00057.] In this paper the main results are the following: i) for a sequence of functions \((f_ n^{(k)}(x_ 1,\dots, x_ n))\) of \(k\)-valued logic \((k\geq 3)\) defined in the paper, the asymptotic complexity of their realizations by schemes consisting of functional elements in the basis \({\mathcal B}_ k=\{\varphi(x,y)\); \(\psi(x,y)\); \(J_ 2(x);\dots;J_{k- 1}(x)\}\) is deduced as a function of \(k\), where \(k\)-valued functions in \({\mathcal B}_ k\) are defined in the paper; ii) for a Boolean function of \(4^ n\) variables recursively defined in the paper the complexity of its realization by schemes of height 3 of functional elements in the basis \(\{\&,\vee,-\}\) is evaluated as a function of \(n\).