Prikl. Diskr. Mat., 2022, Number 58

Prikladnaya Diskretnaya Matematika

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2022, Number 58

Theoretical Backgrounds of Applied Discrete Mathematics
	Analysis of minimal distance of AG-code associated with maximal curve of genus three E. S. Malygina, A. A. Kuninets	5–14
	About the rate of normal approximation for the distribution of the number of repetitions in a stationary discrete random sequence V. G. Mikhailov, N. M. Mezhennaya	15–21
	On ideal class group computation of imaginary multiquadratic fields S. A. Novoselov	22–30
	Direct powers of algebraic structures and equations A. Shevlyakov	31–39

Mathematical Methods of Cryptography
	Search for differences for Alzette S-Box with maximum or close to maximum differential characteristic probability A. A. Dmukh, D. O. Pasko	40–56
	The method for constructing uniform planar approximations of the filter generator L. A. Kuschinskaya	57–68

Applied Graph Theory
	A direct method for calculating cell cycles of a block map of a simple planar graph B. N. Ivanov	69–83
	About uniqueness of the minimal $1$-edge extension of hypercube $Q_4$ A. A. Lobov, M. B. Abrosimov	84–93
	Effective algorithm for finding shortest paths in dense Gaussian networks E. A. Monakhova, O. G. Monakhov	94–104

Mathematical Backgrounds of Informatics and Programming
	The generic complexity of the graph triangulation problem A. N. Rybalov	105–111

Computational Methods in Discrete Mathematics
	Application of idempotent algebra methods in genetic algorithm for solving the scheduling problem A. M. Bulavchuk, D. V. Semenova	112–124