|
This article is cited in 1 scientific paper (total in 1 paper)
On circuits of functional elements of finite depth of branching
D. Yu. Cherukhin
Abstract:
We introduce the notion of the depth of branching of a circuit of functional elements and consider classes of circuits of branching depth bounded by a constant. For these classes of circuits over various bases we obtain lower and upper bounds for complexity of a linear Boolean function. We construct infinitely decreasing sequences of measures of complexity for a fixed base and growing branching depth and for a fixed branching depth but varying base.
Received: 15.03.2005
Citation:
D. Yu. Cherukhin, “On circuits of functional elements of finite depth of branching”, Diskr. Mat., 18:4 (2006), 73–83; Discrete Math. Appl., 16:6 (2006), 577–587
Linking options:
https://www.mathnet.ru/eng/dm73https://doi.org/10.4213/dm73 https://www.mathnet.ru/eng/dm/v18/i4/p73
|
Statistics & downloads: |
Abstract page: | 487 | Full-text PDF : | 337 | References: | 41 | First page: | 5 |
|