Geodesic

Volume 7 (1995) no. 1

Sommaire

Combinatorial problems of vector optimization
p. 3-18
On the complexity of the realization of Boolean matrices with a connected boundary
p. 19-51
Undecidability of the completeness and {\it A}-completeness problems for some systems of automaton functions
p. 52-65
On the completeness of gradient gate circuits
p. 66-76
Multiprocessor scheduling and combinatorial configurations
p. 77-87
On a probabilistic approach to solving systems of equations with integer-valued unknowns
p. 88-98
An algorithm for discrete logarithms over an arbitrary finite field
p. 99-109
Upper bounds on the complexity of the realization of characteristic functions of group codes by switching circuits without zero chains
p. 110-122
On an approach to obtaining statistical estimates for the size of a general population
p. 123-133
On the waiting time in a scheme for the random allocation of colored particles
p. 134-144
On the waiting time in an allocation scheme with reflection
p. 145-151
A.\,A. Markov, 1937--1994.
p. 152-157