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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


2016, Volume 28, Issue 2  


The algorithm for identical object searching with bounded worst-case complexity and linear memory
È. È. Gasanov, A. M. Zubkov, N. V. Klykova
3–11
On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
D. V. Zakablukov
12–26
Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
O. V. Kamlovskii
27–43
Complexity classification of the edge coloring problem for a family of graph classes
D. S. Malyshev
44–50
On FE-precomplete classes in countable-valued logic
S. S. Marchenkov
51–57
On limit behavior of maximum vertex degree in a conditional configuration graph near critical points
Yu. L. Pavlov, E. V. Feklistova
58–70
Estimates of the number of $(k,l)$-sumsets in the finite Abelian group
V. G. Sargsyan
71–80
On the number of functions of $k$-valued logic which are polynomials modulo composite $k$
S. N. Selezneva
81–91
Limit theorems for the number of successes in random binary sequences with random embeddings
B. I. Selivanov, V. P. Chistyakov
92–107
Upper bounds for the size and the depth of formulae for MOD-functions
I. S. Sergeev
108–116
On $1$-stable perfectly balanced Boolean functions
S. V. Smyshlyaev
117–126
On bases of closed classes of vector functions of many-valued logic
V. A. Taimanov
127–132
Bezout rings without non-central idempotents
A. A. Tuganbaev
133–145
Bounds for the average-case complexity of monotone Boolean functions
A. V. Chashkin
146–153
Modular algorithm for reducing matrices to the Smith normal form
M. A. Cherepnev
154–160
Дискретная математика
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026