Geodesic

Volume 23 (2011) no. 3

Sommaire

A fast algorithm for the construction of polynomials modulo~$k$ for $k$-valued functions for composite~$k$
p. 3-22
Some nonequiprobable models of random permutations
p. 23-31
Automaton representation of a~free group
p. 32-56
On estimation of the number of graphs in some hereditary classes
p. 57-62
An asymptotic upper bound for the chromatic index of random hypergraphs
p. 63-81
On stability of the gradient algorithm in convex discrete optimisation problems and related questions
p. 82-92
Minor rank, zeros of the determinant of a~Boolean matrix, and their applications
p. 93-119
Rings over which all modules are completely integrally closed
p. 120-137
A criterion for reducibility of the problem on dangerous closeness to one-dimensional interval search
p. 138-159