Doklady Akademii Nauk
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk, 1993, Volume 328, Number 1, Pages 22–24 (Mi dan5309)  
This article is cited in 3 scientific papers (total in 3 papers)

CYBERNETICS AND THE REGULATION THEORY

Estimates for the complexity of combinatorial optimization problems in a class of algorithms

V. A. Bondarenko

Yaroslavl State University
Full-text PDF (240 kB) Citations (3)
Presented: Ya. Z. Tsypkin
Received: 03.07.1992
Bibliographic databases:
Document Type: Article
UDC: 519.6
Language: Russian
Citation: V. A. Bondarenko, “Estimates for the complexity of combinatorial optimization problems in a class of algorithms”, Dokl. Akad. Nauk, 328:1 (1993), 22–24
Citation in format AMSBIB
\Bibitem{Bon93}
\by V.~A.~Bondarenko
\paper Estimates for the complexity of combinatorial optimization
problems in a class of algorithms
\jour Dokl. Akad. Nauk
\yr 1993
\vol 328
\issue 1
\pages 22--24
\mathnet{http://mi.mathnet.ru/dan5309}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1218954}
\zmath{https://zbmath.org/?q=an:0816.90114}
Linking options:
  • https://www.mathnet.ru/eng/dan5309
  • https://www.mathnet.ru/eng/dan/v328/i1/p22
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025