Exact Value of the Nonmonotone Complexity of Boolean Functions

We study the complexity of the realization of Boolean functions by circuits in infinite complete bases containing all monotone functions with zero weight (cost of use) and finitely many nonmonotone functions with unit weight. The complexity of the realization of Boolean functions in the case where t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical Notes Jg. 105; H. 1-2; S. 28 - 35
Hauptverfasser:	Kochergin, V. V., Mikhailovich, A. V.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.01.2019 Springer Nature B.V
Schlagworte:	Boolean algebra Boolean functions Codes Complexity Markov processes Mathematics Mathematics and Statistics Monotone functions Weight circuit complexity circuits of functional elements Boolean (logical) circuits inversion complexity nonmonotone complexity
ISSN:	0001-4346, 1067-9073, 1573-8876
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!