Geodesic

Sommaire

On the complexity of the realization of Boolean functions in three classes of schemes in a~basis consisting of all symmetric functions
p. 3-8
An error estimate for a~gradient algorithm for independence systems
p. 9-22
On the number of (−1,1)-matrices of order n with a~fixed permanent
p. 23-42
On the complexity of computations in finite nilpotent groups
p. 43-52
A~lower bound on complexity for schemes of the concatenation of words
p. 52-56
A~sufficient condition for the effective solvability of the open shop problem
p. 57-74
On a~property of the traveling salesman problem for a~maximum in a~two-dimensional normed space
p. 75-79
On the complexity of some generalizations of Johnson's two-machine problem
p. 80-90
On English translation of ``Diskretnyi analiz i issledovanie operatsii''