Geodesic

Tome 1 (1989) no. 2

Sommaire

Vector optimization of decompositions of root trees
p. 3-14
Asymptotic normality of symmetric decomposable statistics in an inhomogeneous scheme
p. 15-27
Minimal rectilinear Steiner trees
p. 28-37
Algorithmic complexity of problems of optimal alphabetical coding for context-free languages
p. 38-51
Approximations of words by words without self-duplication
p. 52-56
Conditions for the asymptotic normality of multidimensional randomized decomposable statistics
p. 57-64
Complexity of the solution of the problem of $\alpha$-expressibility in $k$-valued logic
p. 65-77
Asymptotically exact polynomial algorithms in problems of integer linear programming
p. 78-85
Types of two-place relations and their preservation classes in three-valued logic
p. 86-96
The number of permutations with restrictions on the lengths of cycles
p. 97-109
The number of antichains in multilayered ranked sets
p. 110-128
The number of families of subsets that are closed with respect to intersections
p. 129-136
Dimensions of branches of random $m$-trees
p. 137-142
Asymptotic behavior of the number of solutions of a system of permutation equations
p. 143-154
Packings of balls in Euclidean space, and extremal problems for trigonometric polynomials
p. 155-158
VIII All-Union conference on problems of theoretical cybernetics