Volume 29, No 1, 2022
Content

V. V. Voroshilov
Complexity of the max cut problem with the minimal domination constraint
P. 5-17

O. A. Kutnenko
Computational complexity of two problems of cognitive data analysis
P. 18-32

M. A. Lisitsyna and S. V. Avgustinovich
On perfect colorings of paths divisible by a matching
P. 33-45

A. V. Pyatkin and O. I. Chernykh
On the maximum number of open triangles in graphs with the same number of vertices and edge
P. 46-55

S. N. Selezneva
On complexity of searching for periods of functions given by polynomials over a prime field
P. 56-73

I. P. Chukhrov
Properties of Boolean functions with the extremal number of prime implicants
P. 74-93