|
|
2017, Volume 29, Issue 1
|
 |
|
 |
|
Solving systems of linear Boolean equations with noisy right-hand sides over the reals
E. K. Alekseev, I. B. Oshkin, V. O. Popov, S. V. Smyshlyaev
|
3–9 |
|
|
On automorphisms of a distance-regular graph with intersection array $\{99,84,30;1,6,54\}$
K. S. Efimov, A. A. Makhnev
|
10–16 |
|
|
Limit theorem for the size of an image of subset under compositions of random mappings
A. M. Zubkov, A. A. Serov
|
17–26 |
|
|
On periodic properties of polylinear shift registers
O. A. Kozlitin
|
27–50 |
|
|
On the best choice of a branching variable in the subset sum problem
R. M. Kolpakov, M. A. Posypkin
|
51–58 |
|
|
Linearly realizable automata
S. B. Rodin
|
59–79 |
|
|
Верхняя оценка одной комбинаторной суммы
P. V. Roldugin
|
80–94 |
|
|
Computations on register machines with counters
I. V. Savitskii
|
95–113 |
|
|
Estimating the level of affinity of a quadratic form
A. V. Cheremushkin
|
114–125 |
|
|
Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells
N. Yu. Enatskaya
|
126–135 |
|
|
Limit theorems for the logarithm of the order of a random $A$-mapping
A. L. Yakymiv
|
136–155 |
|
|
Contact us: