Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
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



Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find






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


Zh. Vychisl. Mat. Mat. Fiz., 1985, Volume 25, Number 8, Pages 1272–1275 (Mi zvmmf4149)  

This article is cited in 2 scientific papers (total in 2 papers)

Scientific communications

Estimates of the complexity of tabulating trajectory problems

E. N. Gordeev, V. K. Leont'ev

Moscow

Full text: PDF file (439 kB)

English version:
USSR Computational Mathematics and Mathematical Physics, 1985, 25:4, 199–201

Bibliographic databases:

UDC: 519.854.6
MSC: 91B62
Received: 02.11.1983

Citation: E. N. Gordeev, V. K. Leont'ev, “Estimates of the complexity of tabulating trajectory problems”, Zh. Vychisl. Mat. Mat. Fiz., 25:8 (1985), 1272–1275; U.S.S.R. Comput. Math. Math. Phys., 25:4 (1985), 199–201

Citation in format AMSBIB
\Bibitem{GorLeo85}
\by E.~N.~Gordeev, V.~K.~Leont'ev
\paper Estimates of the complexity of tabulating trajectory problems
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 1985
\vol 25
\issue 8
\pages 1272--1275
\mathnet{http://mi.mathnet.ru/zvmmf4149}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=807359}
\zmath{https://zbmath.org/?q=an:0583.90015}
\transl
\jour U.S.S.R. Comput. Math. Math. Phys.
\yr 1985
\vol 25
\issue 4
\pages 199--201
\crossref{https://doi.org/10.1016/0041-5553(85)90169-7}


Linking options:
  • http://mi.mathnet.ru/eng/zvmmf4149
  • http://mi.mathnet.ru/eng/zvmmf/v25/i8/p1272

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Yu. N. Sotskov, “The stability of the approximate Boolean minimization of a linear form”, Comput. Math. Math. Phys., 33:5 (1993), 699–707  mathnet  mathscinet  zmath  isi
    2. V. K. Leont'ev, “Discrete optimization”, Comput. Math. Math. Phys., 47:2 (2007), 328–340  mathnet  crossref  mathscinet  zmath
  • Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Number of views:
    This page:196
    Full text:71
    First page:1

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022