Geodesic

Volume (2019) no. 3

Sommaire

In memory of Valentina Vladimirovna Bykova
Decidability of the restricted theories of a class of~partial orders
p. 6-12
On the degree of restrictions of $q$-valued logic functions to linear manifolds
p. 13-25
On binary solutions to systems of equations
p. 26-32
On the construction of a semantically secure modification of the McEliece cryptosystem
p. 33-43
Sufficient conditions for implementation of Boolean functions by asymptotically optimal on reliability circuits with the trivial estimate of unreliability in the case of faults of type $0$ at the element outputs
p. 44-54
Comparison of sufficient degree based conditions for Hamiltonian graph
p. 55-63
Approximate algorithms for~graph~clustering~problem
p. 64-77
On the one edge algorithm for the orthogonal double covers
p. 78-84
On complexity of the existential and universal theories of finite fields
p. 85-89
Minimization of context-free grammars
p. 90-96
Informational capacity of the Hopfield network with~quantized weights
p. 97-103
The traveling salesman problem: approximate algorithm by branch-and-bound method with~guaranteed precision
p. 104-112
Non-contradictory aggregation of quasi-order relations
p. 113-126