Doklady Akademii Nauk SSSR
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 SSSR, 1975, Volume 224, Number 2, Pages 289–292 (Mi dan39271)  
MATHEMATICS

Complexity of approximate solution of combinatorial problems

R. G. Nigmatullin

Kazan State University
Full-text PDF (586 kB)
Presented: A. A. Dorodnitsyn
Received: 21.03.1975
Bibliographic databases:
Document Type: Article
UDC: 519.14
Language: Russian
Citation: R. G. Nigmatullin, “Complexity of approximate solution of combinatorial problems”, Dokl. Akad. Nauk SSSR, 224:2 (1975), 289–292
Citation in format AMSBIB
\Bibitem{Nig75}
\by R.~G.~Nigmatullin
\paper Complexity of approximate solution of combinatorial problems
\jour Dokl. Akad. Nauk SSSR
\yr 1975
\vol 224
\issue 2
\pages 289--292
\mathnet{http://mi.mathnet.ru/dan39271}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0398169}
\zmath{https://zbmath.org/?q=an:0335.05035}
Linking options:
  • https://www.mathnet.ru/eng/dan39271
  • https://www.mathnet.ru/eng/dan/v224/i2/p289
    • 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