TY  - JOUR
AU  - E. A. Okolnishnikova
TI  - On the complexity of nondeterministic branching programs that realize characteristic functions of Reed--Muller codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2003
SP  - 67
EP  - 81
VL  - 10
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2003_10_3_a4/
LA  - ru
ID  - DA_2003_10_3_a4
ER  -