Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
Prikladnaâ diskretnaâ matematika
Année 2020
no. 1
Précédent
Suivant
Tome (2020) no. 1
Sommaire
A structure of the nearest neighbors collective in a family of partitions of a finite set
S. V. Dronov
p. 5-15
A note on the properties of associated Boolean functions of quadratic APN functions
A. A. Gorodilova
p. 16-21
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
p. 22-29
Theoretically effective asymptotically optimal universal coding of partially defined sources
L. A. Sholomov
p. 30-56
The number of labeled tetracyclic series-parallel blocks
V. A. Voblyi
p. 57-61
Vertex decomposition to calculate the network probabilistic connectivity
D. A. Migov
p. 62-86
A computation of the shortest paths in optimal two-dimensional circulant networks
E. A. Monakhova
p. 87-100
On generic NP-completeness of the problem of Boolean circuits satisfiability
A. N. Rybalov
p. 101-107
A method for bi-decomposition of partial Boolean functions
Yu. V. Pottosin
p. 108-116
Concomitant clusters structure creating by Hammersley–Leath–Alexandrowichz algorithm for percolation cluster generating
D. V. Alekseev
;
G. A. Kazunina
p. 117-127