Geodesic
On a~method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs
Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 4, pp. 76-102.

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

@article{DA_2001_8_4_a5,
     author = {E. A. Okolnishnikova},
     title = {On a~method for obtaining lower bounds for the complexity of the realization of {Boolean} functions by nondeterministic branching programs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {76--102},
     publisher = {mathdoc},
     volume = {8},
     number = {4},
     year = {2001},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2001_8_4_a5/}
}
TY  - JOUR
AU  - E. A. Okolnishnikova
TI  - On a~method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2001
SP  - 76
EP  - 102
VL  - 8
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2001_8_4_a5/
LA  - ru
ID  - DA_2001_8_4_a5
ER  - 
%0 Journal Article
%A E. A. Okolnishnikova
%T On a~method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs
%J Diskretnyj analiz i issledovanie operacij
%D 2001
%P 76-102
%V 8
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2001_8_4_a5/
%G ru
%F DA_2001_8_4_a5
E. A. Okolnishnikova. On a~method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs. Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 4, pp. 76-102. http://geodesic.mathdoc.fr/item/DA_2001_8_4_a5/