|
This article is cited in 1 scientific paper (total in 1 paper)
MATHEMATICS
The complexity of the realization of Boolean functions by schemes and formulas in bases consisting of continuous functions
S. B. Gashkov Lomonosov Moscow State University
Citation:
S. B. Gashkov, “The complexity of the realization of Boolean functions by schemes and formulas in bases consisting of continuous functions”, Dokl. Akad. Nauk SSSR, 250:4 (1980), 782–787
Linking options:
https://www.mathnet.ru/eng/dan43322 https://www.mathnet.ru/eng/dan/v250/i4/p782
|
| Statistics & downloads: |
| Abstract page: | 216 | | Full-text PDF : | 83 | | References: | 4 |
|