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

Celý popis

Podrobná bibliografia

Vydané v:	Mathematical Notes Ročník 105; číslo 1-2; s. 28 - 35
Hlavní autori:	Kochergin, V. V., Mikhailovich, A. V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.01.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!