|
Avtomatika i Telemekhanika, 1981, Issue 11, Pages 124–130
(Mi at6050)
|
|
|
|
Automata
On estimating the implementation complexity of boolean formulae in terms of tree-like structures of adjustible modules
V. L. Artyukhov, G. A. Kopeikin, A. A. Shalyto Leningrad
Abstract:
The upper ,and lower estimates are obtained for complexity of hardware implementation of a Boolean formula by adjustable modules universal in the class of formulae.
Received: 12.09.1980
Citation:
V. L. Artyukhov, G. A. Kopeikin, A. A. Shalyto, “On estimating the implementation complexity of boolean formulae in terms of tree-like structures of adjustible modules”, Avtomat. i Telemekh., 1981, no. 11, 124–130; Autom. Remote Control, 42:11 (1981), 1532–1538
Linking options:
https://www.mathnet.ru/eng/at6050 https://www.mathnet.ru/eng/at/y1981/i11/p124
|
Statistics & downloads: |
Abstract page: | 162 | Full-text PDF : | 68 | First page: | 2 |
|