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, 2010, Volume 50, Number 11, Pages 2045–2051 (Mi zvmmf4971)  

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

On the complexity of some data analysis problems

A. V. Kel'manov

Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Koptyuga 4, Novosibirsk, 630090 Russia
References:
Abstract: NP-completeness of certain discrete optimization problems is proved. These are the problems to which one can reduce some important problems arising in data analysis when certain subsets of vectors are sought.
Key words: discrete optimization problem, complexity, NP-completeness, finding subsets of vectors in the Euclidean space, data analysis.
Received: 14.01.2010
Revised: 16.06.2010
English version:
Computational Mathematics and Mathematical Physics, 2010, Volume 50, Issue 11, Pages 1941–1947
DOI: https://doi.org/10.1134/S0965542510110163
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: A. V. Kel'manov, “On the complexity of some data analysis problems”, Zh. Vychisl. Mat. Mat. Fiz., 50:11 (2010), 2045–2051; Comput. Math. Math. Phys., 50:11 (2010), 1941–1947
Citation in format AMSBIB
\Bibitem{Kel10}
\by A.~V.~Kel'manov
\paper On the complexity of some data analysis problems
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2010
\vol 50
\issue 11
\pages 2045--2051
\mathnet{http://mi.mathnet.ru/zvmmf4971}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2010CMMPh..50.1941K}
\transl
\jour Comput. Math. Math. Phys.
\yr 2010
\vol 50
\issue 11
\pages 1941--1947
\crossref{https://doi.org/10.1134/S0965542510110163}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000284649800016}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-78649766487}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf4971
  • https://www.mathnet.ru/eng/zvmmf/v50/i11/p2045
  • This publication is cited in the following 10 articles:
    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:313
    Full-text PDF :107
    References:60
    First page:11
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024