Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Prikladnaâ diskretnaâ matematika
Année 2019
no. 4
Précédent
Suivant
Volume (2019) no. 4
Sommaire
Some methods for constructing MDS-matrices over~finite field
O. Coy Puente
;
R. A. De La Cruz Jiménez
p. 5-18
$2$
-Transitivity degree for one class of~substitutions over finite fields
D. H. Hernández Piloto
p. 19-26
Cryptanalytical finite~automaton invertibility with finite delay
G. P. Agibalov
p. 27-37
A method for constructing logic networks allowing~short single diagnostic tests
K. A. Popkov
p. 38-57
Associative parallel algorithm for dynamic update of~shortest paths tree after inserting an arc
A. Sh. Nepomniaschaya
;
T. V. Snytnikova
p. 58-71
On generic complexity of~the~graph clustering problem
A. N. Rybalov
p. 72-77
Algorithms for computing cryptographic characteristics of vectorial Boolean functions
N. M. Kiseleva
;
E. S. Lipatova
;
I. A. Pankratova
;
E. E. Trifonova
p. 78-87
Computation of a determinant and a matrix product in~cellular automata
V. S. Kozhevnikov
;
I. V. Matyushkin
p. 88-107
Mutually-recursive formulas for enumerating partitions of the rectangle
A. M. Magomedov
;
T. A. Magomedov
;
S. A. Lawrencenko
p. 108-121
Letter to the editors
A. Yu. Zubov