Iteration-free decomposition of strongly dependent functions

Aleksandr Vasil'evich Cheremushkin · Discrete Mathematics and Applications · 2004

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.

Read the paper · More papers on PaperTik