%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