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 19 (2012)
no. 1
Précédent
Suivant
Sommaire
On reconstructive sets of vertices in the Boolean cube
A. Yu. Vasil'eva
p. 3-16
Approximation algorithms for maximum-weight problem of two-peripatetic salesmen
E. Kh. Gimadi
;
E. V. Ivonina
p. 17-32
About the reliability of nonbranching programs in the basis of a~generalized conjunction
S. M. Grabovskaya
p. 33-40
Enumeration of bent functions on the minimal distance from the quadratic bent function
N. A. Kolomeec
p. 41-58
Lower and upper bounds for the optimal makespan in the multimedia problem
P. A. Kononova
p. 59-73
The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
D. S. Malyshev
p. 74-96