This article is cited in 2 papers

Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions

Yu. V. Merekin

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

UDC: 519.714

Received: 10.03.1999

Bibliographic databases:

• 
•