THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
On the two definitions of degree of a function over an associative, commutative ring // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 5–19. DOI: 10.17223/20710410/37/1
5–19
Hyperelliptic curves, Cartier - Manin matrices and Legendre polynomials // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 20–31. DOI: 10.17223/20710410/37/2
20–31
MATHEMATICAL METHODS OF CRYPTOGRAPHY
On primitivity of mixing digraphs associated with 2-feedbacks shift registers // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 32–51. DOI: 10.17223/20710410/37/3
32–51
General algebraic cryptographic key exchange scheme and its cryptanalysis // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 52–61. DOI: 10.17223/20710410/37/4
52–61
MATHEMATICAL BACKGROUNDS OF COMPUTER AND CONTROL SYSTEM RELIABILITY
Estimations of unreliability of circuits in Rosser - Turkett basis (in P3) with faults of type 0 at the outputs of gates // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 62–75. DOI: 10.17223/20710410/37/5
62–75
MATHEMATICAL BACKGROUNDS OF INFORMATICS AND PROGRAMMING
On application of multidimensional complex analysis in formal language and grammar theory // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 76–89. DOI: 10.17223/20710410/37/6
76–89
Effective translation for LL(1)-grammar in the example of a programming language // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 90–99. DOI: 10.17223/20710410/37/7
90–99
On generic complexity of decidability problem for diophantine systems in the Skolem's form // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 100–106. DOI: 10.17223/20710410/37/8
100–106
Reduction of synapses in the Hopfield autoassociative memory // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 107–113. DOI: 10.17223/20710410/37/9
107–113
COMPUTATIONAL METHODS IN DISCRETE MATHEMATICS
Optimal routing by landmarks in the timedependent networks // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37. P. 114–123. DOI: 10.17223/20710410/37/10
114–123

Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2017. № 37.
Download full-text version
Counter downloads: 615