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, 2004, Volume 11, Number 2  


On the complexity of reliable circuits consisting of unreliable elements with single-type constant faults
M. A. Alekhina
3
Factor coloring of multigraph edges
V. G. Vizing
18
On the computation of partial Boolean functions by cellular schemes
D. A. Zhukov
32
On a method for obtaining bounds for the complexity of schemes over an arbitrary infinite basis
O. M. Kasim-zade
41
Tests for words
V. K. Leont'ev
66
On the number of maximal subgroups in automaton permutation groups
S. S. Marchenkov
73
Deterministic and probabilistic error-free ordered read-once binary programs are equivalent
R. G. Mubarakzyanov
80

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