This article is cited in 2 papers

On the complexity of nondeterministic branching programs that realize characteristic functions of Reed–Muller codes

E. A. Okolnishnikova

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

UDC: 519.714.4+519.725

Received: 19.05.2003

Bibliographic databases:

•