Geodesic
On the complexity of some data analysis problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 11, pp. 2045-2051

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{ZVMMF_2010_50_11_a15,
     author = {A. V. Kel'manov},
     title = {On the complexity of some data analysis problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {2045--2051},
     publisher = {mathdoc},
     volume = {50},
     number = {11},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a15/}
}
TY  - JOUR
AU  - A. V. Kel'manov
TI  - On the complexity of some data analysis problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2010
SP  - 2045
EP  - 2051
VL  - 50
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a15/
LA  - ru
ID  - ZVMMF_2010_50_11_a15
ER  - 
%0 Journal Article
%A A. V. Kel'manov
%T On the complexity of some data analysis problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2010
%P 2045-2051
%V 50
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a15/
%G ru
%F ZVMMF_2010_50_11_a15
A. V. Kel'manov. On the complexity of some data analysis problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 11, pp. 2045-2051. http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_11_a15/