|
This article is cited in 6 scientific papers (total in 6 papers)
Normal algorithms connected with the computation of boolean functions
A. A. Markov
Abstract:
The article deals with lower and upper bounds for the complexity of normal algorithms related to the computation of Boolean functions.
Received: 29.09.1966
Citation:
A. A. Markov, “Normal algorithms connected with the computation of boolean functions”, Math. USSR-Izv., 1:1 (1967), 151–194
Linking options:
https://www.mathnet.ru/eng/im2534https://doi.org/10.1070/IM1967v001n01ABEH000552 https://www.mathnet.ru/eng/im/v31/i1/p161
|
Statistics & downloads: |
Abstract page: | 552 | Russian version PDF: | 193 | English version PDF: | 15 | References: | 47 | First page: | 1 |
|