Geodesic

Volume 16 (2004) no. 4

Sommaire

Analysis of the accuracy of randomized rounding for integer linear programming problems
p. 3-13
Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric~$l_1$
p. 14-19
On the complexity of Boolean functions with a small number of ones
p. 20-31
On a relationship between the eigenvectors of weighted graphs and their subgraphs
p. 32-40
On the number of solutions of the equation $(x_1+\ldots+x_n)^m=ax_1\ldots x_n$ in a finite field
p. 41-48
A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem
p. 49-64
Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees
p. 65-78
Properties of systems of defining relations for automata
p. 79-87
The shortest vectors of lattices connected with a linear congruent generator
p. 88-109
A~family of multivariate $\chi^2$-statistics
p. 110-116
Random free trees and forests with constraints on the multiplicities of vertices
p. 117-133
Homomorphic relations of multibase universal algebras
p. 134-148
Representation of parastrophs of loops and quasigroups
p. 149-157