This article is cited in 4 papers

On a method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs

E. A. Okolnishnikova

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

UDC: 519.714.4+519.725

Received: 28.08.2001

Bibliographic databases:

• 
•