Geodesic

Tome 28 (2016) no. 2

Sommaire

The algorithm for identical object searching with bounded worst-case complexity and linear memory
p. 3-11
On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
p. 12-26
Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
p. 27-43
Complexity classification of the edge coloring problem for a~family of graph classes
p. 44-50
On FE-precomplete classes in countable-valued logic
p. 51-57
On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
p. 58-70
Estimates of the number of $(k,l)$-sumsets in the finite Abelian group
p. 71-80
On the number of functions of $k$-valued logic which are polynomials modulo composite $k$
p. 81-91
Limit theorems for the number of successes in random binary sequences with random embeddings
p. 92-107
Upper bounds for the size and the depth of formulae for MOD-functions
p. 108-116
On $1$-stable perfectly balanced Boolean functions
p. 117-126
On bases of closed classes of vector functions of many-valued logic
p. 127-132
Bezout rings without non-central idempotents
p. 133-145
Bounds for the average-case complexity of monotone Boolean functions
p. 146-153
Modular algorithm for reducing matrices to the Smith normal form
p. 154-160