This article is cited in 1 paper

A sequence of complexly computable functions

L. A. Sholomov

Institute of Control Sciences

Abstract: Specific Boolean functions $f_{n,l}(x_1,\dots,x_n)$ are described and a high lower bound of the complexity of calculations using functional elements is obtained for them. In particular, for some values of the parameter $t=t(n)$ the functions $f_{n,t}$ are the most complex, to within a multiplicative constant, of the $n$-argument functions.

UDC: 519.95

Received: 14.06.1974

 English version: Mathematical Notes, 1975, 17:6, 574–579

Bibliographic databases:

• 
•