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



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Series 1, 2000, Volume 7, Number 2  


An algorithm for finding the minimum spanning tree with a diameter bounded from below
E. Kh. Gimadi, A. I. Serdyukov
3
An algorithm for minimal dynamic flow
V. V. Kabanov
12
On the complexity of determining a connected prescribed coloring of the vertices of a graph
A. V. Kononov, S. V. Sevast'yanov
21
Lower bounds for the number of $m$-quasigroups of order four and of the number of perfect binary codes
D. S. Krotov
47
Lower bounds for the complexity of symbol sequences defined by symmetric Boolean functions
Yu. V. Merekin
54
Estimates for the length of a universal sequence for permutations
V. V. Nyu, D. G. Fon-Der-Flaass
65
Perfect binary codes with a trivial kernel
A. M. Romanov
71
A functional system of infinite-valued propositional calculus
A. S. Tonis, I. G. Perfil'eva
75
Superquadratic lower bounds for the complexity of formulas in some bases
D. Yu. Cherukhin
86

Information
New books for discrete mathematics
A. D. Korshunov
99
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020