Geodesic
On the complexity of the circuit realization of almost all monotone Boolean functions
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 5 (1981), pp. 64-70 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{IVM_1981_5_a8,
     author = {N. N. Nurmeev},
     title = {On the complexity of the circuit realization of almost all monotone {Boolean} functions},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {64--70},
     year = {1981},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1981_5_a8/}
}
TY  - JOUR
AU  - N. N. Nurmeev
TI  - On the complexity of the circuit realization of almost all monotone Boolean functions
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1981
SP  - 64
EP  - 70
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/IVM_1981_5_a8/
LA  - ru
ID  - IVM_1981_5_a8
ER  - 
%0 Journal Article
%A N. N. Nurmeev
%T On the complexity of the circuit realization of almost all monotone Boolean functions
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1981
%P 64-70
%N 5
%U http://geodesic.mathdoc.fr/item/IVM_1981_5_a8/
%G ru
%F IVM_1981_5_a8
N. N. Nurmeev. On the complexity of the circuit realization of almost all monotone Boolean functions. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 5 (1981), pp. 64-70. http://geodesic.mathdoc.fr/item/IVM_1981_5_a8/