Prikl. Diskr. Mat., 2020, Number 47

Prikladnaya Diskretnaya Matematika

RUS ENG

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

2020, Number 47

Theoretical Backgrounds of Applied Discrete Mathematics
	A structure of the nearest neighbors collective in a family of partitions of a finite set S. V. Dronov	5–15
	A note on the properties of associated Boolean functions of quadratic APN functions A. A. Gorodilova	16–21

Mathematical Backgrounds of Computer and Control System Reliability
	Asymptotically optimal in unreliability circuits in the basis consisting of the Webb function in $P_3$ under faults of type $2$ at the outputs of elements O. Yu. Barsukova, M. A. Alekhina	22–29

Applied Coding Theory
	Theoretically effective asymptotically optimal universal coding of partially defined sources L. A. Sholomov	30–56

Applied Graph Theory
	The number of labeled tetracyclic series-parallel blocks V. A. Voblyi	57–61
	Vertex decomposition to calculate the network probabilistic connectivity D. A. Migov	62–86
	A computation of the shortest paths in optimal two-dimensional circulant networks E. A. Monakhova	87–100

Mathematical Backgrounds of Informatics and Programming
	On generic NP-completeness of the problem of Boolean circuits satisfiability A. N. Rybalov	101–107

Computational Methods in Discrete Mathematics
	A method for bi-decomposition of partial Boolean functions Yu. V. Pottosin	108–116

Discrete Models for Real Processes
	Concomitant clusters structure creating by Hammersley–Leath–Alexandrowichz algorithm for percolation cluster generating D. V. Alekseev, G. A. Kazunina	117–127