Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 1998, Volume 10, Issue 1, Pages 63–72
DOI: https://doi.org/10.4213/dm412 (Mi dm412) 		 
This article is cited in 1 scientific paper (total in 1 paper)

A lower bound for the complexity of inclusive search in the class of tree-like circuits

È. È. Gasanov
Full-text PDF (941 kB) Citations (1)
DOI: https://doi.org/10.4213/dm412
Abstract: In the class of tree information networks with a base set of variables we give examples of inclusive search problems such that the order of magnitude of lower bounds for their complexity exceeds the average time of solution output.
This research was supported by the Russian Foundation for Basic Research, grant 95–01–00597.
Received: 13.10.1997
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: È. È. Gasanov, “A lower bound for the complexity of inclusive search in the class of tree-like circuits”, Diskr. Mat., 10:1 (1998), 63–72; Discrete Math. Appl., 8:1 (1998), 99–108
Citation in format AMSBIB
\Bibitem{Gas98}
\by \`E.~\`E.~Gasanov
\paper A lower bound for the complexity of inclusive search in the class of tree-like circuits
\jour Diskr. Mat.
\yr 1998
\vol 10
\issue 1
\pages 63--72
\mathnet{http://mi.mathnet.ru/dm412}
\crossref{https://doi.org/10.4213/dm412}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1669071}
\zmath{https://zbmath.org/?q=an:0972.94051}
\transl
\jour Discrete Math. Appl.
\yr 1998
\vol 8
\issue 1
\pages 99--108
Linking options:
  • https://www.mathnet.ru/eng/dm412
  • https://doi.org/10.4213/dm412
  • https://www.mathnet.ru/eng/dm/v10/i1/p63
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:339
    Full-text PDF :191
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024