Geodesic
On the complexity of nondeterministic branching programs that realize characteristic functions of Reed--Muller codes
Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 3, pp. 67-81

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

@article{DA_2003_10_3_a4,
     author = {E. A. Okolnishnikova},
     title = {On the complexity of nondeterministic branching programs that realize characteristic functions of {Reed--Muller} codes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {67--81},
     publisher = {mathdoc},
     volume = {10},
     number = {3},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2003_10_3_a4/}
}
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  - 
%0 Journal Article
%A E. A. Okolnishnikova
%T On the complexity of nondeterministic branching programs that realize characteristic functions of Reed--Muller codes
%J Diskretnyj analiz i issledovanie operacij
%D 2003
%P 67-81
%V 10
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2003_10_3_a4/
%G ru
%F DA_2003_10_3_a4
E. A. Okolnishnikova. On the complexity of nondeterministic branching programs that realize characteristic functions of Reed--Muller codes. Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 3, pp. 67-81. http://geodesic.mathdoc.fr/item/DA_2003_10_3_a4/