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 29 (2022)
no. 1
Précédent
Suivant
Sommaire
Complexity of the max cut problem with~the~minimal domination constraint
V. V. Voroshilov
p. 5-17
Computational complexity of two problems of~cognitive~data~analysis
O. A. Kutnenko
p. 18-32
On perfect colorings of paths divisible~by~a~matching
M. A. Lisitsyna
;
S. V. Avgustinovich
p. 33-45
On the maximum number of open triangles in~graphs with the same number of~vertices~and~edges
A. V. Pyatkin
;
O. I. Chernykh
p. 46-55
On complexity of searching for periods of~functions given by polynomials over~a~prime~field
S. N. Selezneva
p. 56-73
Properties of Boolean functions with the~extremal number of prime implicants
I. P. Chukhrov
p. 74-93