Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 1998, Volume 5, Issue 4, Pages 71–80 (Mi da373)  
On the algorithmic complexity of the classical reliability problem

A. A. Chernyak

Belarusian State University, Faculty of Mathematics and Mechanics
Full-text PDF (941 kB)
Received: 04.06.1997
Revised: 18.02.1998
Bibliographic databases:
UDC: 519.71+519.1
Language: Russian
Citation: A. A. Chernyak, “On the algorithmic complexity of the classical reliability problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998), 71–80
Citation in format AMSBIB
\Bibitem{Che98}
\by A.~A.~Chernyak
\paper On the algorithmic complexity of the classical reliability problem
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1998
\vol 5
\issue 4
\pages 71--80
\mathnet{http://mi.mathnet.ru/da373}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1680291}
\zmath{https://zbmath.org/?q=an:0931.90009}
Linking options:
  • https://www.mathnet.ru/eng/da373
  • https://www.mathnet.ru/eng/da/v5/s1/i4/p71
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:312
    Full-text PDF :125
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024