-
In memory of Valentina Vladimirovna Bykova // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 5.
5
THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
Decidability of the restricted theories of a class of partial orders // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 6–12. DOI: 10.17223/20710410/45/1
6–12
On the degree of restrictions of q-valued logic functions to linear manifolds // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 13–25. DOI: 10.17223/20710410/45/2
13–25
On binary solutions to systems of equations // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 26–32. DOI: 10.17223/20710410/45/3
26–32
MATHEMATICAL METHODS OF CRYPTOGRAPHY
On the construction of a semantically secure modification of the McEliece cryptosystem // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 33–43. DOI: 10.17223/20710410/45/4
33–43
MATHEMATICAL BACKGROUNDS OF COMPUTER AND CONTROL SYSTEM RELIABILITY
Sufficient conditions for implementation of Boolean functions by asymptotically optimal on reliability circuits with the trivial estimate of unreliability in the case of faults of type 0 at the element outputs // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 44–54. DOI: 10.17223/20710410/45/5
44–54
APPLIED GRAPH THEORY
Comparison of sufficient degree based conditions for Hamiltonian graph // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 55–63. DOI: 10.17223/20710410/45/6
55–63
Approximate algorithms for graph clustering problem // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 64–77. DOI: 10.17223/20710410/45/7
64–77
On the one edge algorithm for the orthogonal double covers // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 78–84. DOI: 10.17223/20710410/45/8
78–84
MATHEMATICAL BACKGROUNDS OF INFORMATICS AND PROGRAMMING
On complexity of the existential and universal theories of finite fields // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 85–89. DOI: 10.17223/20710410/45/9
85–89
Minimization of context-free grammars // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 90–96. DOI: 10.17223/20710410/45/10
90–96
Informational capacity of the Hopfield network with quantized weights // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 97–103. DOI: 10.17223/20710410/45/11
97–103
COMPUTATIONAL METHODS IN DISCRETE MATHEMATICS
The traveling salesman problem: approximate algorithm by branch-and-bound method with guaranteed precision // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 104–112. DOI: 10.17223/20710410/45/12
104–112
MATHEMATICAL BACKGROUNDS OF INTELLIGENT SYSTEMS
Non-contradictory aggregation of quasi-order relations // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45. P. 113–126. DOI: 10.17223/20710410/45/13
113–126

Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2019. № 45.
Download full-text version
Counter downloads: 384