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


2011, Volume 23, Issue 3  


A fast algorithm for the construction of polynomials modulo $k$ for $k$-valued functions for composite $k$
S. N. Selezneva
3
Some nonequiprobable models of random permutations
G. I. Ivchenko, M. V. Soboleva
23
Automaton representation of a free group
S. V. Aleshin
32
On estimation of the number of graphs in some hereditary classes
V. A. Zamaraev
57
An asymptotic upper bound for the chromatic index of random hypergraphs
Yu. A. Budnikov
63
On stability of the gradient algorithm in convex discrete optimisation problems and related questions
A. B. Ramazanov
82
Minor rank, zeros of the determinant of a Boolean matrix, and their applications
V. B. Poplavskii
93
Rings over which all modules are completely integrally closed
A. A. Tuganbaev
120
A criterion for reducibility of the problem on dangerous closeness to one-dimensional interval search
E. A. Snegova
138
Дискретная математика
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019