Geodesic

Tome 2 (1990) no. 1

Sommaire

The method of Newton sums in problems of combinatorial optimization
p. 3-15
The edge independence number and the covering number for regular graphs
p. 16-25
Conditions for regularity of finite autonomous automata
p. 26-30
Superpositions of automata and linear spaces connected with them
p. 31-42
An asymptotic formula for the number of self-inverse labeled oriented graphs
p. 43-49
Extremal ideals of the lattice of multisets for symmetric functionals
p. 50-58
Optimal trajectories of a dynamic programming scheme and extremal degrees of nonnegative matrices
p. 59-71
Universal labyrinth traps for finite sets of automata
p. 72-79
Self-correction for buffer switching circuits
p. 80-86
Representation of dictionary predicates from the arithmetical hierarchy
p. 87-93
Solution of systems of automaton equations
p. 94-103
Almost optimal trees for computing logic functions
p. 104-112
Embeddedness of partitions, distributions and weighings
p. 113-129
An optimal search for extrema of convex functions on lattices
p. 130-141
Lower bounds on computation time
p. 142-154
Upper bounds for the capacity of discrete communication channels
p. 155-157