Geodesic

Volume 12 (2000) no. 2

Sommaire

Statistical problems related to the organization of the control of processes of the generation of discrete random sequences
p. 3-24
On the stability radius of a vector problem of linear Boolean programming
p. 25-30
On the time of attaining a maximum by a critical branching process in a random environment and by a stopped random walk
p. 31-50
On recognizing labyrinths by automata
p. 51-65
Crossed homomorphisms of finite algebras with a scheme of binary operators
p. 66-84
On the complexity of the disjunctive normal form of threshold functions
p. 85-92
Probability of correct decoding for a channel with additive normal noise and a binary symmetric channel with a random choice of code words
p. 93-98
On the entropy of hereditary classes of colored graphs
p. 99-102
Functional aspects of the completeness problem for some classes of automaton functions
p. 103-117
Estimates for the complexity of a method for solving the problem of inclusive search
p. 118-139
Linear recursive MDS-codes of dimensions~2 and~3
p. 140-153
On a property of associated representations of the group $\mathrm{GL}(n,k)$
p. 154-159