|
In memory of Valentina Vladimirovna Bykova
G. P. Agibalov, I. A. Pankratova
|
5 |
|
|
Theoretical Backgrounds of Applied Discrete Mathematics
|
|
|
Decidability of the restricted theories of a class of partial orders
A. Yu. Nikitin
|
6–12 |
|
|
On the degree of restrictions of $q$-valued logic functions to linear manifolds
V. G. Ryabov
|
13–25 |
|
|
On binary solutions to systems of equations
A. V. Seliverstov
|
26–32 |
|
|
Mathematical Methods of Cryptography
|
|
|
On the construction of a semantically secure modification of the McEliece cryptosystem
Y. V. Kosolapov, O. Y. Turchenko
|
33–43 |
|
|
Mathematical Backgrounds of Computer and Control System Reliability
|
|
|
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
M. A. Alekhina, S. M. Grabovskaya, Yu. S. Gusynina
|
44–54 |
|
|
Applied Graph Theory
|
|
|
Comparison of sufficient degree based conditions for Hamiltonian graph
M. B. Abrosimov
|
55–63 |
|
|
Approximate algorithms for graph clustering problem
V. P. Il'ev, S. D. Il'eva, A. V. Morshinin
|
64–77 |
|
|
On the one edge algorithm for the orthogonal double covers
R. El-Shanawany, A. El-Mesady
|
78–84 |
|
|
Mathematical Backgrounds of Informatics and Programming
|
|
|
On complexity of the existential and universal theories of finite fields
A. N. Rybalov
|
85–89 |
|
|
Minimization of context-free grammars
Yu. D. Ryazanov, S. V. Nazina
|
90–96 |
|
|
Informational capacity of the Hopfield network with quantized weights
M. S. Tarkov
|
97–103 |
|
|
Computational Methods in Discrete Mathematics
|
|
|
The traveling salesman problem: approximate algorithm by branch-and-bound method with guaranteed precision
Yu. L. Kostyuk
|
104–112 |
|
|
Mathematical Backgrounds of Intelligent Systems
|
|
|
Non-contradictory aggregation of quasi-order relations
V. N. Nefedov, S. O. Smerchinskaya, N. P. Yashina
|
113–126 |
Contact us: