Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
Prikladnaâ diskretnaâ matematika
Année 2019
no. 1
Précédent
Suivant
Tome (2019) no. 1
Sommaire
An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial
S. A. Belov
p. 5-15
Bernoulli's discrete periodic functions
M. S. Bespalov
p. 16-36
Characterizations of non associative ordered semigroups by the properties of their fuzzy ideals with thresholds
$(\alpha,\beta]$
K. Nasreen
p. 37-59
Authentication encryption based on authentication code with secrecy
A. Yu. Zubov
p. 60-69
On the arbitrarily reliable implementation of Boolean functions by non-branching programs with a conditional stop operator in bases with generalized conjunction
S. M. Grabovskaya
;
M. A. Alekhina
p. 70-77
Synthesis of easily testable logic networks under arbitrary stuck-at faults at inputs and outputs of gates
K. A. Popkov
p. 78-100
On properties of primitive sets of digraphs with common cycles
Y. E. Avezova
p. 101-114
On improved universal estimation of exponents of digraphs
V. M. Fomichev
p. 115-123