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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical Notes Vol. 105; no. 1-2; pp. 28 - 35
Main Authors:	Kochergin, V. V., Mikhailovich, A. V.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.01.2019 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!