On approximation with given accuracy of functions of k-valued logic by polynomials

Articles in the same Issue

1. On approximation with given accuracy of functions of k-valued logic by polynomials
2. On complexity of realisation of a class of almost symmetric functions by formulas of depth 3
3. On complexity of linear operators on the class of circuits of depth 2
4. On the complexity of decoding Boolean cube splitting into cube faces
5. Some characteristics of dependencies in discrete random sequences
6. On random 2-adjacent 0/1-polyhedra
7. The intersection number of complete r-partite graphs
8. On Mazurov triples of the sporadic group B and Hamiltonian cycles of the Cayley graph
9. Malcev rings