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, 1981, Volume 261, Number 1, Pages 20–23 (Mi dan44824)  
This article is cited in 4 scientific papers (total in 5 papers)

MATHEMATICS

Connectedness of sets in best approximation problems

S. V. Konyagin
Full-text PDF (559 kB) Citations (5)
Presented: S. M. Nikol'skii
Received: 11.05.1981
Bibliographic databases:
Document Type: Article
UDC: 513.88
Language: Russian
Citation: S. V. Konyagin, “Connectedness of sets in best approximation problems”, Dokl. Akad. Nauk SSSR, 261:1 (1981), 20–23
Citation in format AMSBIB
\Bibitem{Kon81}
\by S.~V.~Konyagin
\paper Connectedness of sets in best approximation problems
\jour Dokl. Akad. Nauk SSSR
\yr 1981
\vol 261
\issue 1
\pages 20--23
\mathnet{http://mi.mathnet.ru/dan44824}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0636850}
\zmath{https://zbmath.org/?q=an:0508.41025}
Linking options:
  • https://www.mathnet.ru/eng/dan44824
  • https://www.mathnet.ru/eng/dan/v261/i1/p20
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:117
    Full-text PDF :45
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024