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  -