Geodesic
The complexity of realizing partial Boolean functions by schemes consisting of functional elements
Diskretnaya Matematika, Tome 1 (1989) no. 4, pp. 251-261.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DM_1989_1_4_a4,
     author = {A. E. Andreev},
     title = {The complexity of realizing partial {Boolean} functions by schemes consisting of functional elements},
     journal = {Diskretnaya Matematika},
     pages = {251--261},
     publisher = {mathdoc},
     volume = {1},
     number = {4},
     year = {1989},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1989_1_4_a4/}
}
TY  - JOUR
AU  - A. E. Andreev
TI  - The complexity of realizing partial Boolean functions by schemes consisting of functional elements
JO  - Diskretnaya Matematika
PY  - 1989
SP  - 251
EP  - 261
VL  - 1
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1989_1_4_a4/
LA  - ru
ID  - DM_1989_1_4_a4
ER  - 
%0 Journal Article
%A A. E. Andreev
%T The complexity of realizing partial Boolean functions by schemes consisting of functional elements
%J Diskretnaya Matematika
%D 1989
%P 251-261
%V 1
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1989_1_4_a4/
%G ru
%F DM_1989_1_4_a4
A. E. Andreev. The complexity of realizing partial Boolean functions by schemes consisting of functional elements. Diskretnaya Matematika, Tome 1 (1989) no. 4, pp. 251-261. http://geodesic.mathdoc.fr/item/DM_1989_1_4_a4/