|
|
2009, Volume 21, Issue 2
|
|
|
|
|
Reconstruction of automata by fragments of behaviour V. B. Kudryavtsev, I. S. Grunskii, V. A. Kozlovskii
|
3–42 |
|
Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric V. A. Emelichev, O. V. Karelkina
|
43–50 |
|
New methods of investigation of perfectly balanced Boolean functions O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko
|
51–74 |
|
On completeness and $A$-completeness of $S$-sets of determinate functions containing all one-place determinate $S$-functions M. A. Podkolzina
|
75–87 |
|
On repetition-free Boolean functions over pre-elementary monotone bases I. K. Sharankhaev
|
88–93 |
|
Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions S. P. Gorshkov, A. V. Tarasov
|
94–101 |
|
On reliability of circuits over the bases $\{\sim,\&,\oplus\}$, $\{\sim,\&,0\}$, $\{\oplus,\&,1\}$, $\{\oplus,\vee,1\}$ in the case of faults of type 0 at the outputs of elements M. A. Alekhina
|
102–111 |
|
Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials M. I. Tikhomirova
|
112–125 |
|
On a class of statistics of polynomial samples B. I. Selivanov
|
126–137 |
|
On one statistical model of steganography K. I. Ponomarev
|
138–145 |
|
The diameter of the ridge-graph of a cyclic polytope A. N. Maksimenko
|
146–152 |
|
On the edge colouring of bipartite graphs A. M. Magomedov
|
153–158 |
|
|