Geodesic

Sommaire du Fascicule no. 1

Statistical estimation of the composition of a finite set
p. 3-40
The numbers of ascending segments in a random permutation and in one inverse to it are asymptotically independent
p. 41-51
On some algebras associated with fast algorithms
p. 52-64
On the computation of logarithms on elliptic curves
p. 65-71
On the complexity of the problem of determining the number of solutions of systems of Boolean equations
p. 72-85
A completeness criterion for nonhomogeneous functions with delays
p. 86-98
Basic relations for the $S$-classification of functions of multivalued logic
p. 99-128
On closed classes of $k$-valued logic that are self-dual with respect to transitive groups
p. 129-156

Sommaire du Fascicule no. 2

Limit distribution of the probabilities of the permanent of a random matrix in the field $\operatorname{GF}(p)$
p. 3-13
On the number of readings of random nonequiprobable files under stable sorting
p. 14-30
Limit distribution of the number of trees of given size in a random forest
p. 31-47
On vector invariants of the symmetric group
p. 48-62
The singularity of some relations and their combinatorial applications
p. 63-88
The unsolvability of vector discrete optimization problems in a class of algorithms of a linear convolution of criteria
p. 89-96
The structure of information distribution in an infinite sequence
p. 97-107
Search problems on graphs of regular polyhedra
p. 108-116
Checking tests for superpositions of Boolean functions from elementary homogeneous functions
p. 117-132
On the complexity of restrictions of Boolean functions
p. 133-150
On the comparison of the complexity of two methods for realizing some linear Boolean transformations
p. 151-159

Sommaire du Fascicule no. 3

Ideals and filters of partitions and cyclic classes, and invariance domains of permutations
p. 3-21
On a connection between the complexities of the discrete logarithmization and the Diffie--Hellman problems
p. 22-30
О сильно регулярных расширениях обобщенных четырехугольников с~короткими прямыми
p. 31-39
On a class of weakly semi-abelian polyadic groups
p. 40-46
Limit theorems for large deviations of sums of independent not necessarily identically distributed lattice random vectors
p. 47-64
On limit theorems for decomposable statistics in a generalized allocation scheme
p. 65-89
On the overstructure of a class of polynomials in many-valued logics
p. 90-97
Lower bounds for the time complexity of deterministic conditional tests
p. 98-110
On complete checking tests for quasi-iteration-free switching circuits
p. 111-118
Instantaneously solvable search problems
p. 119-134
The discretization problem: analysis of computational complexity, and polynomially solvable subclasses
p. 135-147
Multiple packings and coverings of a sphere
p. 148-160

Sommaire du Fascicule no. 4

On the automaton model of the learning process
p. 3-10
A variant of the proof of a completeness criterion for functions of $k$-valued logic
p. 11-36
On the synthesis of minimal sources
p. 37-43
О сложности нумеpующих опеpатоpов
p. 44-56
On the coding of discrete figures
p. 57-61
On metric clustering
p. 62-78
On the decidability of the completeness problem for special systems of automata functions
p. 79-91
Estimates for the number of threshold functions
p. 92-107
A lower bound for the complexity of information networks for a partial ordering relation
p. 108-122
Automaton complexity of two-place Boolean bases
p. 123-133
On simple universal mosaic homogeneous structures
p. 134-142
On the reconstruction of the segmentation of dynamic patterns
p. 143-148
On an algebra of images
p. 149-156
Valerii Borisovich Kudryavtsev (on the occasion of his sixtieth birthday)
p. 157-158