A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k

Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables

“…Selezneva [9] has shown that for composite k the problem of deciding polynomiality of a k -valued function f (x 1 , …, x n ) from a vector of N = k n values and, in case of positive decision, finding its polynomial is of complexity O(k n ) in the class of circuits with separated variables. Thus, in the Boolean case, this problem is of higher complexity in the class of circuits with separated variables.…”

“…Circuit complexity of binary addition and multiplication has been investigated in [3][4][5]. Circuit complexity of the solution of some problems involving Boolean and many-valued functions for the case when the functions are defined by vectors of their values have been considered by Alekseev [6], Voronenko [7,8], and Selezneva [9].…”