RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

2023, Number 60


Theoretical Backgrounds of Applied Discrete Mathematics
Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group
A. R. Belov
5
Properties of exponential transformations of finite field
A. A. Gruba
13
The number of occurrences of elements from a given subset on the complication segments of linear recurrence sequences
A. S. Tissin
30

Mathematical Methods of Cryptography
Ways to improve the performance of zero-knowledge succinct non-interactivearguments of knowledge and the analysis of the rusults achieved
I. V. Martynenkov
40
On additive differential probabilities of a composition of bitwise XORs
I. A. Sutormin, N. A. Kolomeets
59

Applied Graph Theory
On the complexity of graph clustering in the problem with bounded cluster sizes
R. V. Baldzhanova, A. V. Ilev, V. P. Il'ev
76
Finding a family of simple circuits in graphs with vertex semidegrees bounded by $k$
A. A. Medvedev
85

Logical Design of Discrete Automata
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
Yu. V. Pottosin
95

Mathematical Backgrounds of Informatics and Programming
On the solution of a general algebraic equation by power series and applications in the theory of formal grammars
O. I. Egorushkin, I. V. Kolbasina, K. V. Safonov
106
On generic complexity of the graph clustering problem with bounded clusters
A. N. Rybalov
114

Computational Methods in Discrete Mathematics
Solving of the maxisum location problem on network with a restriction on transport costs
G. G. Zabudsky
120


© Steklov Math. Inst. of RAS, 2026