Geodesic

Volume 4 (1992) no. 3

Sommaire

The behavior of automata in labyrinths
p. 3-28
Scheme complexity of discrete optimization
p. 29-46
$T$-partitions of quasigroups and groups
p. 47-56
On an encoding system constructed on the basis of generalized Reed--Solomon codes
p. 57-63
Random minimal coverings of sets
p. 64-74
On the compatibility of a~system of random comparisons
p. 75-85
On the length of test automaton-realizable experiments with automaton labyrinths
p. 86-100
An asymptotic formula for the number of asymmetric graphs
p. 101-107
Transportation polytopes with a~minimal number of $k$-faces
p. 108-117
A~lower bound on the complexity of information networks for a~class of information search problems
p. 118-127
Some classes of permutations with cycle lengths in a~given set
p. 128-134
On Slupecki classes in the systems $P_k\times\dots\times P_l$
p. 135-148
Russo's formula for Poisson point fields and its applications
p. 149-160