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, 2002, Volume 9, Issue 1, Pages 54–58 (Mi da169)  
On a relation between lower bounds for the complexity of schemes of functional elements and the minimal covering problem

K. L. Rychkov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (263 kB)
References:
PDF
HTML
Received: 23.09.2001
Bibliographic databases:
UDC: 519.714.4
Language: Russian
Citation: K. L. Rychkov, “On a relation between lower bounds for the complexity of schemes of functional elements and the minimal covering problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002), 54–58
Citation in format AMSBIB
\Bibitem{Ryc02}
\by K.~L.~Rychkov
\paper On a relation between lower bounds for the complexity of schemes of functional elements and the minimal covering problem
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2002
\vol 9
\issue 1
\pages 54--58
\mathnet{http://mi.mathnet.ru/da169}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1930047}
\zmath{https://zbmath.org/?q=an:1011.68041}
Linking options:
  • https://www.mathnet.ru/eng/da169
  • https://www.mathnet.ru/eng/da/v9/s1/i1/p54
    • 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