Exact Value of the Nonmonotone Complexity of Boolean Functions
- 5 Downloads
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 the only nonmonotone element of the basis is negation was completely described by A. A. Markov: the minimum number of negations sufficient for the realization of an arbitrary Boolean function f (the inversion complexity of the function f) is equal to ⌈log2(d(f) + 1)⌉, where d(f) is the maximum (over all increasing chains of sets of values of the variables) number of changes of the function value from 1 to 0. In the present paper, this result is generalized to the case of the computation of Boolean functions over an arbitrary basis B of prescribed form. It is shown that the minimum number of nonmonotone functions sufficient for computing an arbitrary Boolean function f is equal to ⌈log2(d(f)/D(B) +1)⌉, where D(B) = max d(ω); the maximum is taken over all nonmonotone functions ω of the basis B.
KeywordsBoolean (logical) circuits circuits of functional elements circuit complexity inversion complexity nonmonotone complexity
Unable to display preview. Download preview PDF.
- 2.O. B. Lupanov, Asymptotic Estimates of Complexity of Control Systems (Izd. Moskov. Univ., Moscow, 1984) [in Russian].Google Scholar
- 5.E. N. Gilbert, “Theoretical–structural properties of closing switching functions,” in Collection of Papers in Cybernetics (Inostr. Lit.,Moscow, 1960), No. 1, pp. 175–188 [Russian transl. ].Google Scholar
- 6.É. I. Nechiporuk, “On complexity of circuits in some bases containing nontrivial elements with zero weights,” in Problems of Cybernetics (Fizmatgiz, Moscow, 1962), No. 8, pp. 123–160 [in Russian].Google Scholar
- 7.M. J. Fischer, “The complexity of negation–limited networks–a brief survey,” in Automata Theory and Formal Languages, Lecture Notes in Comput. Sci. (Springer–Verlag, Berlin, 1975), Vol. 33, pp. 71–82.Google Scholar
- 8.H. Morizumi, A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas, arXiv: 0811. 0699 (2008).Google Scholar
- 9.S. Jukna, Boolean Function Complexity. Advances and Frontiers, in Algorithms Combin. (Springer–Verlag, Berlin, 2012), Vol. 27.Google Scholar
- 10.E. Blais, C. L. Canonne, I. C. Oliveira, R. A. Servedio, and L.–Y. Tan, “Learning circuits with few negations,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, LIPIcs. Leibniz Int. Proc. Inform. (Schloss Dagstuhl. Leibniz–Zent. Inform., Wadern, 2015), Vol. 40, pp. 512–527.MathSciNetzbMATHGoogle Scholar
- 12.V. V. Kochergin and A. V. Mikhailovich, Inversion Complexity of Functions of Multi–Valued Logic, arXiv: 1510. 05942 (2015).Google Scholar
- 14.V. V. Kochergin and A. V. Mikhailovich, Some Extensions of the Inversion Complexity of Boolean Function, arXiv: 1506. 04485 (2015).Google Scholar
- 15.V. V. Kochergin and A. V. Mikhailovich, “On the complexity of circuits in bases containing monotone elements with zero weights,” Prikl. Diskret. Mat., No. 4 (30), 24–31 (2015).Google Scholar