Loading [MathJax]/jax/output/SVG/config.js
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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2012, Volume 52, Number 12, Pages 2284–2291 (Mi zvmmf9816)  
This article is cited in 3 scientific papers (total in 3 papers)

О сложности некоторых задач выбора подпоследовательности векторов

A. V. Kel'manov, A. V. Pyatkin

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Full-text PDF (380 kB) Citations (3)
References:
PDF
HTML
Received: 01.08.2011
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. V. Kel'manov, A. V. Pyatkin, “О сложности некоторых задач выбора подпоследовательности векторов”, Zh. Vychisl. Mat. Mat. Fiz., 52:12 (2012), 2284–2291
Citation in format AMSBIB
\Bibitem{KelPya12}
\by A.~V.~Kel'manov, A.~V.~Pyatkin
\paper О сложности некоторых задач выбора подпоследовательности векторов
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2012
\vol 52
\issue 12
\pages 2284--2291
\mathnet{http://mi.mathnet.ru/zvmmf9816}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf9816
  • https://www.mathnet.ru/eng/zvmmf/v52/i12/p2284
    • This publication is cited in the following 3 articles:
    1. Kel'manov A., Khamidullin S., Khandeev V., Pyatkin A., “Exact Algorithms For Two Integer-Valued Problems of Searching For the Largest Subset and Longest Subsequence”, Ann. Math. Artif. Intell., 88:1-3 (2020), 157–168  crossref  isi
    2. A. V. Kelmanov, S. M. Romanchenko, S. A. Khamidullin, “An approximation scheme for a problem of finding a subsequence”, Num. Anal. Appl., 10:4 (2017), 313–323  mathnet  crossref  crossref  isi  elib
    3. A. V. Eremeev, A. V. Kel'manov, A. V. Pyatkin, “On the complexity and approximability of some Euclidean optimal summing problems”, Comput. Math. Math. Phys., 56:10 (2016), 1813–1817  mathnet  crossref  crossref  isi  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Statistics & downloads:
    Abstract page:314
    Full-text PDF :69
    References:69
    First page:22
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025