RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

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, 1999, Volume 6, Number 3  


Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
Yu. V. Merekin
3
On transformations that improve the reliability of parts of circuits in automaton bases
V. N. Noskov
10
Modeling of circuits consisting of functional elements by Turing machines
A. V. Chashkin
42
Residual reliability of $P$-threshold graphs
A. A. Chernyak
71
On the complexity of problems of minimization and compression of models of sequential choice
L. A. Sholomov
87
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018