On the positive and the inversion complexity of Boolean functions

V. Dičiūnas

On the positive and the inversion complexity of Boolean functions

V. Dičiūnas

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1993)

Volume: 27, Issue: 4, page 283-293
ISSN: 0988-3754

Access Full Article

top

Access to full text

Full (PDF)

How to cite

top

MLA
BibTeX
RIS

Dičiūnas, V.. "On the positive and the inversion complexity of Boolean functions." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 27.4 (1993): 283-293. <http://eudml.org/doc/92451>.

@article{Dičiūnas1993,
author = {Dičiūnas, V.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {circuit complexity; realization of Boolean functions by circuits},
language = {eng},
number = {4},
pages = {283-293},
publisher = {EDP-Sciences},
title = {On the positive and the inversion complexity of Boolean functions},
url = {http://eudml.org/doc/92451},
volume = {27},
year = {1993},
}

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
PB - EDP-Sciences
VL - 27
IS - 4
SP - 283
EP - 293
LA - eng
KW - circuit complexity; realization of Boolean functions by circuits
UR - http://eudml.org/doc/92451
ER -

References

top

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). MR1086979
2. O. B. LUPANOV, On synthesis of threshold circuits, Problemy kibernetiki, 26, 1973, pp. 109-140 (in Russian). Zbl0265.94026 MR484809
3. A. A. MARKOV, On the inversion complexity of a system of functions, J. ACM, 5, 1958, pp. 331-334. Zbl0085.11601 MR111686
4. N. P. REDKIN, On synthesis of threshold circuits for some classes of Boolean functions, Kibernetika, 5, 1970 pp. 6-9 (in Russian). Zbl0225.94016 MR290878
5. M. SANTHA, C. WILSON, Polynomial size constant depth circuits with a limited number of negations, LNCS, 480, 1991, pp. 228-237. Zbl0764.94025 MR1101173
6. I. WEGENER, The complexity of the parity function in unbounded fan-in, unbounded depth circuits, Theor. Comp. Sc., 85, 1991, pp. 155-170. Zbl0749.94025 MR1118134

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Language to use for this widget.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Number of notes per page

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.