Asymptotics for the Complexity of Boolean Functions with Small Number of Ones

The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered. For small , for example, for , an asymptotics for the complexity of implementation of every function in by a circuit of functional elements in an...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical Notes Vol. 109; no. 1-2; pp. 256 - 261
Main Author:	Red’kin, N. P.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.01.2021 Springer Nature B.V
Subjects:	14/34 639/766/189 639/766/530 639/766/747 Asymptotic properties Boolean Boolean algebra Boolean functions Circuits Complexity Mathematical analysis Mathematics Mathematics and Statistics complexity of a function Boolean function circuit
ISSN:	0001-4346, 1067-9073, 1573-8876
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!