EN|RU

Volume 26, No 4, 2019
Content

S. V. Avgustinovich and E. V. Gorkunov
Maximum intersection of linear codes and codes equivalent to linear
P. 5-15

V. L. Beresnev and A. A. Melnikov
A bilevel “Attacker–Defender” model to choosing the composition of attack means
P. 16-33

V. A. Vasil’ev
Undominatedness of equilibria in a mixed economy of Arrow–Debreu type
P. 34-55

A. A. Romanova and V. V. Servakh
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
P. 56-73

K. L. Rychkov
On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube
P. 74-107

I. S. Sergeev
On a relation between the depth and complexity of monotone Boolean formulas
P. 108-120

A. S. Shaporenko
Relationship between homogeneous bent functions and Nagy graphs
P. 121-131

 © Sobolev Institute of Mathematics, 2015