The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials
Anton V. Bukhman · Moscow University Computational Mathematics and Cybernetics · 2011
A k-valued logic function is considered for prime numbers k. Polynomial algorithms for recognizing whether k-valued logic functions given in polynomials according to modulo k preserve sets of the forms E(lx i ) and E(lx i )\{0}, where E(g(x)) is the range of values of function g(x), are constructed. The number of sets that can be recognized as preserved by the proposed algorithms is estimated.