Prikl. Diskr. Mat., 2024, Number 64

Prikladnaya Diskretnaya Matematika

RUS ENG

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

2024, Number 64

	To the 85th anniversary of Gennady Petrovich Agibalov	5–6

Theoretical Backgrounds of Applied Discrete Mathematics
	Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets A. Yu. Nikitin, N. D. Kudyk	7–19
	Comparison of outerplanarity and generalized outerplanarity properties for Cayley graphs of planar semigroups D. V. Solomatin	20–26

Mathematical Methods of Cryptography
	Streebog as a random oracle L. R. Akhmetzyanova, A. A. Babueva, A. A. Bozhko	27–42

Mathematical Backgrounds of Computer and Control System Reliability
	Graph methods for recognition of CMOS gates in transistor-level circuits D. I. Cheremisinov, L. D. Cheremisinova	43–55

Applied Graph Theory
	Database analysis of optimal double-loop networks E. A. Monakhova, O. G. Monakhov	56–71

Mathematical Backgrounds of Informatics and Programming
	On the generic complexity of solving equations over natural numbers with addition A. N. Rybalov	72–78

Computational Methods in Discrete Mathematics
	Simplified formula for summing discrete values of some functions V. R. Osipov	79–98
	Makespan minimization in reentrant flow shop problem with identical jobs A. A. Romanova, V. V. Servakh, V. Yu. Tavchenko	99–111
	Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs A. A. Soldatenko, D. V. Semenova, E. I. Ibragimova	112–127