Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

2025, Number 68  

Theoretical Backgrounds of Applied Discrete Mathematics
On the order of smoothness of the smallest concave extension of a Boolean function
D. N. Barotov, R. N. Barotov 		5–15
Curvature of some classes of Boolean functions
A. A. Panpurin 		16–28
Computational work for some $TU$-based permutations
D. B. Fomin, D. I. Trifonov 		29–55

Applied Coding Theory
A non-asymptotic estimate of the probability that a Shur — Hadamard square of long random linear code has a maximum dimension
I. V. Chizhov 		56–70

Applied Graph Theory
Graph traversals implemented by iterative methods for solving systems of linear equations
A. V. Prolubnikov 		71–93
Role coloring of graphs from rooted products
M. Komathi, P. Ragukumar 		94–102

Computational Methods in Discrete Mathematics
On the average number of solutions in the knapsack problem
M. S. A. Volkov, E. N. Gordeev, V. K. Leontiev 		103–113
Approximate solution of the maximin problem of locating facilities on a network with constraints on minimum distances
G. G. Zabudskii 		114–122
Прикладная дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026