Prikl. Diskr. Mat., 2018, Number 41

Prikladnaya Diskretnaya Matematika

RUS ENG

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

2018, Number 41

Theoretical Backgrounds of Applied Discrete Mathematics
	On the number of homogeneous nondegenerate $p$-ary functions of the given degree M. I. Anokhin	5–16
	On constructing APN permutations using subfunctions V. A. Idrisova	17–27

Mathematical Methods of Cryptography
	Criteria for Markov block ciphers O. V. Denisov	28–37
	A nonlinear decomposition method in analysis of some encryption schemes using group automorphisms V. A. Roman'kov, A. A. Obzor	38–45

Applied Graph Theory
	Periods of $\varphi$-graphs N. A. Artemova	46–53
	The check of the correspondence of the directed graph to the algebraic lattice S. V. Belim, N. F. Bogachenko	54–65
	Structural properties of minimal primitive digraphs P. V. Lebedev	66–75
	New families of multiplicative circulant networks E. A. Monakhova	76–84

Mathematical Backgrounds of Informatics and Programming
	Minimization of syntax diagrams with multiport components Yu. D. Ryazanov	85–97

Computational Methods in Discrete Mathematics
	The architecture of a neural network with a sequential division of images into pairs P. Sh. Geidarov	98–109
	Method for sequential activation of limitations in linear programming V. S. Kolosov	110–125