RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Sibirsk. Zh. Issled. Oper., 1994 Volume 1, Issue 4, Pages 33–52 (Mi da499)

This article is cited in 8 papers

Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions

K. L. Rychkov

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

UDC: 519.714

Received: 26.09.1994



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026