Geodesic

Tome 27 (1994)

Sommaire

On the isometricity of densely packed binary codes
p. 3-5
Complexity of the network problem of a median on planar lattices
p. 6-13
On the complexity of the approximate realization of some classical functions
p. 14-33
On linear extensions of partially ordered sets
p. 34-42
On the number of graphs with a fixed number of vertices, edges, and isolated vertices
p. 43-93
On the complexity of computations of monomials and tuples of powers
p. 94-107
Decision trees with quasilinear tests
p. 108-141
Transformation of schemes consisting of functional elements into a form that is suitable for control
p. 142-165
On limit distributions of random variables generated by bounded sequences
p. 166-176