|
Sibirskii Zhurnal Issledovaniya Operatsii, 1994, Volume 1, Issue 4, Pages 33–52
(Mi da499)
|
|
|
|
This article is cited in 8 scientific papers (total 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
Received: 26.09.1994
Citation:
K. L. Rychkov, “Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions”, Sibirsk. Zh. Issled. Oper., 1:4 (1994), 33–52
Linking options:
https://www.mathnet.ru/eng/da499 https://www.mathnet.ru/eng/da/v1/i4/p33
|
Statistics & downloads: |
Abstract page: | 261 | Full-text PDF : | 93 | First page: | 1 |
|