Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnaya Matematika
Tome 32 (2020)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Universal functions for linear functions depending on two variables
A. A. Voronenko
;
A. S. Okuneva
p. 3-7
On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
D. V. Zakablukov
p. 8-26
Perfect matchings and
$K_{1, p}$
-restricted graphs
P. A. Irzhavski
;
Yu. L. Orlovich
p. 27-50
Boolean analogues of Pascal triangle with the maximum possible number of ones
F. M. Malyshev
p. 51-59
On the action of the implicative closure operator on the set of partial functions of the multivalued logic
S. S. Marchenkov
p. 60-73
On distance-regular graphs with
$c_2=2$
A. A. Makhnev
;
M. S. Nirova
p. 74-80
On the complexity of monotone circuits for threshold symmetric Boolean functions
I. S. Sergeev
p. 81-109
Reduction of the integer factorization complexity upper bound to the complexity of the Diffie--Hellman problem
M. A. Cherepnev
p. 110-114
Classification of Hadamard productsof one-codimensional subcodesof Reed--Muller codes
I. V. Chizhov
;
M. A. Borodin
p. 115-134
Large deviations of branching process in a random environment. II
A. V. Shklyaev
p. 135-156
Sommaire du
Fascicule no. 2
On the numerical semigroup generated by
$\{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\}$
Ze Gu
p. 3-14
On the complexity of implementation of a~system of two monomials by composition circuits
S. A. Korneev
p. 15-31
Implementation complexity of Boolean functions with a small number of ones
N. P. Red'kin
p. 32-43
Conditions of A-completeness for linear automata over dyadic rationals
D. V. Ronzhin
p. 44-60
On the degree of restrictions of
$q$
-valued logic vector functions to linear manifolds
V. G. Ryabov
p. 61-70
Trees with a given number of leaves and the maximal number of maximum independent sets
D. S. Taletskii
;
D. S. Malyshev
p. 71-84
On the use of binary operations for the construction of a multiply transitive class of block transformations
I. V. Cherednik
p. 85-111
Medial strong dependance
$n$
-ary operations
A. V. Cheremushkin
p. 112-121
Letter to the Editors
G. A. Bakai
;
A. V. Shklyaev
p. 122-123
Sommaire du
Fascicule no. 3
Properties of multitype subcritical branching processes in random environment
V. A. Vatutin
;
E. E. D'yakonova
p. 3-23
Asymptotical local probabilities of lower deviations for branching process in random environment with geometric distributions of descendants
K. Yu. Denisov
p. 24-37
Ergodicity of the probabilistic converter, a serial connection of two automata
I. A. Kruglov
p. 38-48
Bounds on Shannon functions of lengths of contact closure tests for contact circuits
K. A. Popkov
p. 49-67
Minimal contact circuits for characteristic functions of spheres
N. P. Red'kin
p. 68-75
A family of asymptotically independent statistics in polynomial scheme containing the Pearson statistic
M. P. Savelov
p. 76-84
Multiaffine polynomials over a finite field
S. N. Selezneva
p. 85-97
Linear recurrent relations, power series distributions, and generalized allocation scheme
A. N. Timashev
p. 98-112
Pseudo orthogonal Latin squares
S. Faruqi
;
S. Katre
;
M. Garg
p. 113-129
On the average-case complexity of Boolean functions under binomial distribution on their domains
A. V. Chashkin
p. 130-134
Variance of the number of cycles of random
$A$
-permutation
A. L. Yakymiv
p. 135-146
A letter to the Editor
A. V. Cheremushkin
Sommaire du
Fascicule no. 4
Diagnostic tests under shifts with fixed filling tuple
G. V. Antyufeev
p. 3-9
New lower bound for the minimal number of edges of simple uniform hypergraph without the property
$B_k$
Yu. A. Demidovich
p. 10-37
Computation of distributions of statistics by means of Markov chains
A. M. Zubkov
;
M. V. Filina
p. 38-51
Generalized de Bruijn graphs
F. M. Malyshev
p. 52-88
Approximation of restrictions of
$q$
-valued logic functions to linear manifolds by affine analogues
V. G. Ryabov
p. 89-102
Group service system with three queues and load balancing
M. P. Savelov
p. 103-119
Formulas for the numbers of sequences containing a given pattern given number of times
A. A. Serov
p. 120-136