Geodesic

Tome 29 (2022) no. 1

Sommaire

Complexity of the max cut problem with the minimal domination constraint
p. 5-17
Computational complexity of two problems of cognitive data analysis
p. 18-32
On perfect colorings of paths divisible by a matching
p. 33-45
On the maximum number of open triangles in graphs with the same number of vertices and edges
p. 46-55
On complexity of searching for periods of functions given by polynomials over a prime field
p. 56-73
Properties of Boolean functions with the extremal number of prime implicants
p. 74-93