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, 1999, Volume 6, Issue 3, Pages 87–109 (Mi da323)  
This article is cited in 3 scientific papers (total in 3 papers)

On the complexity of problems of minimization and compression of models of sequential choice

L. A. Sholomov

Institute of Systems Analysis, Russian Academy of Sciences
Full-text PDF (2603 kB) Citations (3)
Received: 22.02.1999
Bibliographic databases:
UDC: 519.816
Language: Russian
Citation: L. A. Sholomov, “On the complexity of problems of minimization and compression of models of sequential choice”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:3 (1999), 87–109
Citation in format AMSBIB
\Bibitem{Sho99}
\by L.~A.~Sholomov
\paper On the complexity of problems of minimization and compression of models of sequential choice
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1999
\vol 6
\issue 3
\pages 87--109
\mathnet{http://mi.mathnet.ru/da323}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1762288}
\zmath{https://zbmath.org/?q=an:0928.91019}
Linking options:
  • https://www.mathnet.ru/eng/da323
  • https://www.mathnet.ru/eng/da/v6/s1/i3/p87
    • 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
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:261
    Full-text PDF :73
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024