Geodesic
On the complexity of the realization of Boolean functions by circuits in an infinite basis
Diskretnyj analiz i issledovanie operacij, Tome 2 (1995) no. 1, pp. 7-20.

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

@article{DA_1995_2_1_a1,
     author = {O. M. Kasim-zade},
     title = {On the complexity of the realization of {Boolean} functions by circuits in an infinite basis},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {7--20},
     publisher = {mathdoc},
     volume = {2},
     number = {1},
     year = {1995},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1995_2_1_a1/}
}
TY  - JOUR
AU  - O. M. Kasim-zade
TI  - On the complexity of the realization of Boolean functions by circuits in an infinite basis
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1995
SP  - 7
EP  - 20
VL  - 2
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1995_2_1_a1/
LA  - ru
ID  - DA_1995_2_1_a1
ER  - 
%0 Journal Article
%A O. M. Kasim-zade
%T On the complexity of the realization of Boolean functions by circuits in an infinite basis
%J Diskretnyj analiz i issledovanie operacij
%D 1995
%P 7-20
%V 2
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1995_2_1_a1/
%G ru
%F DA_1995_2_1_a1
O. M. Kasim-zade. On the complexity of the realization of Boolean functions by circuits in an infinite basis. Diskretnyj analiz i issledovanie operacij, Tome 2 (1995) no. 1, pp. 7-20. http://geodesic.mathdoc.fr/item/DA_1995_2_1_a1/