|
This article is cited in 11 scientific papers (total in 11 papers)
Repetition-free decomposition of strongly dependent functions
A. V. Cheremushkin
Abstract:
Some results on decomposition of boolean functions are generalised
to the case of discrete $k$-valued functions. Autotopy and isostrophy
groups and parameters of functions with non-trivial decompositions
are considered.
Received: 24.06.2003 Revised: 22.06.2004
Citation:
A. V. Cheremushkin, “Repetition-free decomposition of strongly dependent functions”, Diskr. Mat., 16:3 (2004), 3–42; Discrete Math. Appl., 14:5 (2004), 439–478
Linking options:
https://www.mathnet.ru/eng/dm161https://doi.org/10.4213/dm161 https://www.mathnet.ru/eng/dm/v16/i3/p3
|
Statistics & downloads: |
Abstract page: | 659 | Full-text PDF : | 347 | References: | 86 | First page: | 1 |
|