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

Articles in the same Issue

1. On the stability radius of an efficient solution of a multicriteria portfolio optimisation problem with the Savage criteria
2. On minimisation of the double-sided shadow in the unit cube
3. On the singular series in the Waring–Goldbach problem with shifted primes
4. On the number of n-ary quasigroups of finite order
5. An algorithm for construction of the annihilator of a polylinear recurring sequence over a finite commutative ring
6. Minor rank, zeros of the determinant of a Boolean matrix, and their applications
7. On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number
8. A fast algorithm for the construction of polynomials modulo k for k-valued functions for composite k
9. The best asymptotic representation of Boolean functions by information graphs
10. A criterion for reducibility of the problem on dangerous closeness to one-dimensional interval search
11. A criterion for a partial prediction of general regular superevents
12. On construction of an explicit basis for admissible inference rules of modal logics extending S4.1