THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
Characterization of APN-permutations in terms of Hamming distance between subgroups of symmetric group // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 5–12. DOI: 10.17223/20710410/60/1
5–12
Properties of exponential transformations of finite field // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 13–29. DOI: 10.17223/20710410/60/2
13–29
The number of occurrences of elements from a given subset on the complication segments of linear recurrence sequences // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 30–39. DOI: 10.17223/20710410/60/3
30–39
MATHEMATICAL METHODS OF CRYPTOGRAPHY
Ways to improve the performance of zero-knowledge succinct non-interactivearguments of knowledge and the analysis of the rusults achieved // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 40–58. DOI: 10.17223/20710410/60/4
40–58
On additive differential probabilities of a composition of bitwise XORs // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 59–75. DOI: 10.17223/20710410/60/5
59–75
APPLIED GRAPH THEORY
On the complexity of graph clustering in the problem with bounded cluster sizes // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 76–84. DOI: 10.17223/20710410/60/6
76–84
Finding a family of simple circuits in graphs with vertex semidegrees bounded by k // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 85–94. DOI: 10.17223/20710410/60/7
85–94
LOGICAL DESIGN OF DISCRETE AUTOMATA
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 95–105. DOI: 10.17223/20710410/60/8
95–105
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 // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 106–113. DOI: 10.17223/20710410/60/9
106–113
On generic complexity of the graph clustering problem with bounded clusters // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 114–119. DOI: 10.17223/20710410/60/10
114–119
COMPUTATIONAL METHODS IN DISCRETE MATHEMATICS
Solving of the maxisum location problem on network with a restriction on transport costs // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60. P. 120–127. DOI: 10.17223/20710410/60/11
120–127

Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2023. № 60.
Download full-text version
Counter downloads: 126