Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnyj analiz i issledovanie operacij
Tome 20 (2013)
no. 4
Précédent
Suivant
Sommaire
The complexity of cyclic scheduling for identical jobs
E. A. Bobrova
;
A. A. Romanova
;
V. V. Servakh
p. 3-14
A lower bound on formula size of a~ternary linear function
Yu. L. Vasil'ev
;
K. L. Rychkov
p. 15-26
Stability analysis of the efficient solution to a~vector problem of a~maximum cut
V. A. Emelichev
;
K. G. Kuzmin
p. 27-35
A
2
-approximation polynomial algorithm for one clustering problem
A. V. Kelmanov
;
V. I. Khandeev
p. 36-45
Steiner quadruple systems of small ranks and extended perfect binary codes
D. I. Kovalevskaya
;
F. I. Solov'eva
p. 46-64
On minimal circuts in Sheffer basis for linear Boolean functions
Yu. A. Kombarov
p. 65-87
Simple cycles in the
n
-cube with a~large group of automorphisms
A. L. Perezhogin
p. 88-97