Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

On the positive and the inversion complexity of Boolean functions

V. Dičiūnas

RAIRO-Theor. Inf. Appl., 27 4 (1993) 283-293

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/1993270402831

This article has been cited by the following article(s):

On the non-monotone complexity of Boolean and k-value logic functions

Vadim Vasilievich Kochergin and Anna Vitalievna Mihajlovich
Mathematical Problems of Cybernetics (22) 51 (2024)
https://doi.org/10.20948/mvk-2024-51

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In

György Turán and Farrokh Vatan
Journal of Computer and System Sciences 54 (1) 199 (1997)
https://doi.org/10.1006/jcss.1997.1480