On the positive and the inversion complexity of Boolean functions
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 4, pp. 283-293. 
@article{ITA_1993__27_4_283_0,
     author = {Di\v{c}i\={u}nas, V.},
     title = {On the positive and the inversion complexity of {Boolean} functions},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {283--293},
     publisher = {EDP-Sciences},
     volume = {27},
     number = {4},
     year = {1993},
     mrnumber = {1238051},
     zbl = {0789.68070},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1993__27_4_283_0/}
}
TY  - JOUR
AU  - Dičiūnas, V.
TI  - On the positive and the inversion complexity of Boolean functions
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1993
SP  - 283
EP  - 293
VL  - 27
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1993__27_4_283_0/
LA  - en
ID  - ITA_1993__27_4_283_0
ER  - 
%0 Journal Article
%A Dičiūnas, V.
%T On the positive and the inversion complexity of Boolean functions
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1993
%P 283-293
%V 27
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1993__27_4_283_0/
%G en
%F ITA_1993__27_4_283_0
Dičiūnas, V. On the positive and the inversion complexity of Boolean functions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 4, pp. 283-293. http://archive.numdam.org/item/ITA_1993__27_4_283_0/

1. V. Dičiūnas, Computing of symmetric functions with restricted threshold curcuits, Mathematical logic and its applications, Inst. of Math. and Cyb. of the Lithuanian Acad. of Sci., 6, 1989, pp. 38-50 (in Russian). | MR

2. O. B. Lupanov, On synthesis of threshold circuits, Problemy kibernetiki, 26, 1973, pp. 109-140 (in Russian). | MR | Zbl

3. A. A. Markov, On the inversion complexity of a system of functions, J. ACM, 5, 1958, pp. 331-334. | MR | Zbl

4. N. P. Redkin, On synthesis of threshold circuits for some classes of Boolean functions, Kibernetika, 5, 1970 pp. 6-9 (in Russian). | MR | Zbl

5. M. Santha, C. Wilson, Polynomial size constant depth circuits with a limited number of negations, LNCS, 480, 1991, pp. 228-237. | MR | Zbl

6. I. Wegener, The complexity of the parity function in unbounded fan-in, unbounded depth circuits, Theor. Comp. Sc., 85, 1991, pp. 155-170. | MR | Zbl