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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical Notes Jg. 109; H. 1-2; S. 256 - 261
1. Verfasser: Red’kin, N. P.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Moscow Pleiades Publishing 01.01.2021
Springer Nature B.V
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 irredundant basis containing and is found.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0001-4346
1067-9073
1573-8876
DOI:10.1134/S0001434621010296