|
|
2021, Number 52
|
 |
|
 |
|
Theoretical Backgrounds of Applied Discrete Mathematics
|
|
Binary solutions to large systems of linear equations
A. V. Seliverstov
|
5–15 |
|
|
Algorithmic theory of solvable groups
V. A. Roman'kov
|
16–64 |
|
|
On the nonexistence of certain orthogonal arrays of strength four
R. Kiss, G. P. Nagy
|
65–68 |
|
|
Mathematical Backgrounds of Computer Security
|
|
|
Detection of malware using an artificial neural network based on adaptive resonant theory
D. G. Bukhanov, V. M. Polyakov, M. A. Redkina
|
69–82 |
|
|
The techniques of formalization of OS Astra Linux Special Edition access control model using Event-B formal method for verification using Rodin and ProB
P. N. Devyanin, M. A. Leonova
|
83–96 |
|
|
Applied Graph Theory
|
|
|
The maximum number of vertices of primitive regular graphs of orders $2, 3, 4$ with exponent $2$
M. B. Abrosimov, S. V. Kostin, I. V. Los
|
97–104 |
|
|
Metric for comparing graphs with ordered vertices based on the maximum common subgraph
N. D. Moskin
|
105–113 |
|
|
Discrete closed one-particle chain of contours
P. A. Myshkis, A. G. Tatashev, M. V. Yashina
|
114–125 |
|
|
Contact us: