|
On the power of sets of alternatives in discrete multicriterial problems
V. A. Emelichev, V. A. Perepelitsa
|
3–12 |
|
|
On the organization of knowledge bases in view of automatic problem solving
A. S. Podkolzin
|
13–30 |
|
|
A lower bound on the time complexity of an integer problem on the uniqueness of elements
L. V. Nosov
|
31–34 |
|
|
One-dimensional projections of polyhedra of problems of discrete optimization
M. N. Vyalyi
|
35–45 |
|
|
Enumeration of Hamiltonian cycles
A. A. V'yalitsin
|
46–49 |
|
|
Inequalities for functionals generated by bipartite graphs
A. F. Sidorenko
|
50–65 |
|
|
On the compact summation of vectors
S. V. Sevast'yanov
|
66–72 |
|
|
Limit theorems for decomposable statistics and efficiencies of the corresponding statistical tests
G. I. Ivchenko, Sh. A. Mirakhmedov
|
73–88 |
|
|
Integral limit theorems for lacunary distributions
A. V. Nagaev
|
89–101 |
|
|
Hypercycles in a random hypergraph
G. V. Balakin, V. F. Kolchin, V. I. Khokhlov
|
102–108 |
|
|
On the number of permutations with cycle lengths in a given set
A. I. Pavlov
|
109–123 |
|
|
On the functional system $P_{k,\Pi}$
V. V. Kudryavtsev
|
124–134 |
|
|
A new proof of the Budach – Podkolzin theorem
G. Kilibarda
|
135–146 |
|
|
Ravines of functions and absolutely nonuniform sets and functions
E. G. Belousov, V. G. Andronov
|
147–158 |
|
|
Information
|
|
|
Review of a book, B. A. Bondarenko “Generalized Pascal triangles and pyramids, their fractals, graphs and applications”
T. A. Azlarov, N. A. Volodin
|
159–160 |
Contact us: