Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
Diskretnyj analiz i issledovanie operacij
Tome 26 (2019)
no. 4
Précédent
Suivant
Tome 26 (2019) no. 4
Sommaire
Maximum intersection of linear codes and codes equivalent to linear
S. V. Avgustinovich
;
E. V. Gorkunov
p. 5-15
A bilevel “Attacker–Defender” model to choosing the composition of attack means
V. L. Beresnev
;
A. A. Melnikov
p. 16-33
Undominatedness of equilibria in a mixed economy of Arrow–Debreu type
V. A. Vasil'ev
p. 34-55
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
A. A. Romanova
;
V. V. Servakh
p. 56-73
On the perfectness of minimal regular partitions of the edge set of the
$n$
-dimensional cube
K. L. Rychkov
p. 74-107
On a relation between the depth and complexity of monotone Boolean formulas
I. S. Sergeev
p. 108-120
Relationship between homogeneous bent functions and Nagy graphs
A. S. Shaporenko
p. 121-131