Geodesic

Sommaire du Fascicule no. 1

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''

Sommaire du Fascicule no. 2

ϵ-entropy and discrete analogues of classes of entire analytic functions
p. 3-14
Combinatorial complexity of scheduling jobs with simple linear growth of processing times
p. 15-32
On transformations of combinational circuits that increase the reliability of their parts
p. 33-61
Asymptotically minimal self-correcting schemes for a~sequence of Boolean functions
p. 62-79
A~lower bound for the number of vertices of the convex hull of integer and mixed-integer points of a~polyhedron
p. 80-89
New books for discrete mathematics
p. 90-91

Sommaire du Fascicule no. 3

Discrete analogues of infinitely smooth functions
p. 3-39
On a~relation between the computation time of a~direct mapping and an inverse mapping
p. 40-46
G-precomplete classes of many-valued logic
p. 47-70
On extensions of partial geometries containing small μ-subgraphs
p. 71-83
Rank inequalities that generate facets of a~polyhedron of connected k-factors
p. 84-110

Sommaire du Fascicule no. 4

Colorings and topological representations of graphs
p. 3-27
A~very short proof of Dirac's theorem on the number of edges in chromatically critical graphs
p. 28-34
Constructive descriptions of graphs
p. 35-63
On the existence of spanning circuits in graphs with short cycles
p. 64-68
On a~locally isometric coding of natural numbers
p. 69-76
A~search for a~partially known word in a~dictionary
p. 77-92
New books for discrete mathematics
p. 93-94