On the positive and the inversion complexity of Boolean functions
Dičiūnas, V.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993), p. 283-293 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1993-01-01
@article{ITA_1993__27_4_283_0,
     author = {Di\v ci\=unas, V.},
     title = {On the positive and the inversion complexity of Boolean functions},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {27},
     year = {1993},
     pages = {283-293},
     mrnumber = {1238051},
     zbl = {0789.68070},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 283-293. http://gdmltest.u-ga.fr/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 1086979

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

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

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

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

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 1118134 | Zbl 0749.94025