Prikl. Diskr. Mat., 2017, Number 38

Prikladnaya Diskretnaya Matematika

RUS ENG

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

2017, Number 38

Theoretical Backgrounds of Applied Discrete Mathematics
	One approach to constructing a transitive class of block transformations I. V. Cherednik	5–34
	On almost nilpotent varieties of anticommutative metabelian algebras O. V. Shulezhko, N. P. Panov	35–48
	On irreducible algebraic sets over linearly ordered semilattices II A. N. Shevlyakov	49–56

Mathematical Methods of Cryptography
	Substitution block ciphers with functional keys G. P. Agibalov	57–65

Mathematical Backgrounds of Computer and Control System Reliability
	Single fault detection tests for logic networks of AND, NOT gates K. A. Popkov	66–88

Applied Graph Theory
	On minimal vertex $1$-extensions of path orientation M. B. Abrosimov, O. V. Modenova	89–94

Mathematical Backgrounds of Informatics and Programming
	On generic complexity of the problem of finding roots in groups of residues A. N. Rybalov	95–100
	Complexes in LYaPAS V. O. Safonov, D. A. Stefantsov	101–109

Computational Methods in Discrete Mathematics
	Analysis of $L$-structure of polyhedron in the partial MAX SAT problem A. V. Adelshin, A. K. Kuchin	110–118
	Improvement of the lower bound for the complexity of exponentiation V. V. Kochergin, D. V. Kochergin	119–132