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


2012, Volume 19, Number 3  


The computation complexity in the class of formulas
S. V. Avgustinovich, Yu. L. Vasil'ev, K. L. Rychkov
3
On complexity of optimal recombination for one scheduling problem with setup times
A. V. Eremeev, Yu. V. Kovalenko
13
Approximation algorithms for some NP-hard problems of searching a vectors subsequence
A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin
27
On minimal realizations of linear Boolean functions
Yu. A. Kombarov
39
Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique
D. S. Malyshev
58
Preemptive routing open shop on a link
A. V. Pyatkin, I. D. Chernykh
65
On minimal complexes of faces in the unit cube
I. P. Chukhrov
79
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020