|
This article is cited in 10 scientific papers (total in 11 papers)
The complexity of the realization of symmetrical functions by formulae
V. M. Khrapchenko Institute of Applied Mathematics, Academy of Sciences of the USSR
Abstract:
It is proved that every symmetric function in $k$-valued logic of $n$ arguments can be realized by a formula in any basis, the complexity of the formula not exceeding $n^C$, where $C$ is a constant depending on the basis. It is shown that in the case $k=2$, $C\leqslant 4,93$ for all bases.
Received: 24.12.1970
Citation:
V. M. Khrapchenko, “The complexity of the realization of symmetrical functions by formulae”, Mat. Zametki, 11:1 (1972), 109–120; Math. Notes, 11:1 (1972), 70–76
Linking options:
https://www.mathnet.ru/eng/mzm9769 https://www.mathnet.ru/eng/mzm/v11/i1/p109
|
Statistics & downloads: |
Abstract page: | 182 | Full-text PDF : | 95 | First page: | 1 |
|