An algorithm of solving the m-dimensional knapsack problem with random coefficients

Articles in the same Issue

1. Errors of gradient extrema of a strictly convex function of discrete argument
2. An algorithm of solving the m-dimensional knapsack problem with random coefficients
3. On the uniform id-decomposability of Boolean functions
4. Fast correlation decoding of some word subsets of the first order Reed-Muller code
5. Feed-back operation and the class of group automata
6. An estimate of incomplete multiplicative character sum of polynomials
7. On constructing the minimal realizations of hypergraphs
8. On the complexity of domination number determination in monogenic classes of graphs
9. Sums of subpermanents of linear spans of substitution matrices
10. The zero-one law for the many-sorted logic of the first order predicates
11. On the structure of random digraphs with labelled edges
12. Multidimensional local theorems on large deviations in the equiprobable allocation scheme