Geodesic

Sommaire

Complexity of the determination of the maximum weighted joining in a~graph
p. 3-8
Minimal coverings of a~Boolean cube by centered antichains
p. 9-17
On the number of connected sets with given cardinality of a~neighborhood in a~graph
p. 18-34
On the accuracy of solutions of location problems for a~maximum by greedy algorithms
p. 35-48
On the computation of Boolean functions by probabilistic programs
p. 49-68
Local complexity of Boolean functions
p. 69-80