Geodesic
О сложности некоторых задач выбора подпоследовательности векторов
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 52 (2012) no. 12, pp. 2284-2291 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2012_52_12_a13,
     author = {A. V. Kel'manov and A. V. Pyatkin},
     title = {{\CYRO} {\cyrs}{\cyrl}{\cyro}{\cyrzh}{\cyrn}{\cyro}{\cyrs}{\cyrt}{\cyri} {\cyrn}{\cyre}{\cyrk}{\cyro}{\cyrt}{\cyro}{\cyrr}{\cyrery}{\cyrh} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch} {\cyrv}{\cyrery}{\cyrb}{\cyro}{\cyrr}{\cyra} {\cyrp}{\cyro}{\cyrd}{\cyrp}{\cyro}{\cyrs}{\cyrl}{\cyre}{\cyrd}{\cyro}{\cyrv}{\cyra}{\cyrt}{\cyre}{\cyrl}{\cyrsftsn}{\cyrn}{\cyro}{\cyrs}{\cyrt}{\cyri} {\cyrv}{\cyre}{\cyrk}{\cyrt}{\cyro}{\cyrr}{\cyro}{\cyrv}},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {2284--2291},
     year = {2012},
     volume = {52},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_12_a13/}
}
TY  - JOUR
AU  - A. V. Kel'manov
AU  - A. V. Pyatkin
TI  - О сложности некоторых задач выбора подпоследовательности векторов
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2012
SP  - 2284
EP  - 2291
VL  - 52
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_12_a13/
LA  - ru
ID  - ZVMMF_2012_52_12_a13
ER  - 
%0 Journal Article
%A A. V. Kel'manov
%A A. V. Pyatkin
%T О сложности некоторых задач выбора подпоследовательности векторов
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2012
%P 2284-2291
%V 52
%N 12
%U http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_12_a13/
%G ru
%F ZVMMF_2012_52_12_a13
A. V. Kel'manov; A. V. Pyatkin. О сложности некоторых задач выбора подпоследовательности векторов. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 52 (2012) no. 12, pp. 2284-2291. http://geodesic.mathdoc.fr/item/ZVMMF_2012_52_12_a13/

[1] Kelmanov A. V., Pyatkin A. V., “NP-polnota nekotorykh zadach vybora podmnozhestva vektorov”, Diskretnyi analiz i issledovanie operatsii, 17:5 (2010), 37–45

[2] Kelmanov A. V., Khamidullin S. A., “Aposteriornoe obnaruzhenie zadannogo chisla odinakovykh podposledovatelnostei v kvaziperiodicheskoi posledovatelnosti”, Zh. vychisl. matem. i matem. fiz., 41:5 (2001), 807–820 | MR

[3] Gimadi E. Kh., Kelmanov A. V., Kelmanova M. A., Khamidullin S. A., “Aposteriornoe obnaruzhenie v chislovoi posledovatelnosti kvaziperiodicheskogo fragmenta pri zadannom chisle povtorov”, Sibirsk. zh. industr. matem., 9:1(25) (2006), 55–74 | MR | Zbl

[4] Kelmanov A. V., Mikhailova L. V., “Sovmestnoe obnaruzhenie v kvaziperiodicheskoi posledovatelnosti zadannogo chisla fragmentov iz etalonnogo nabora i ee razbienie na uchastki, vklyuchayuschie serii odinakovykh fragmentov”, Zh. vychisl. matem. i matem. fiz., 46:1 (2006), 172–189 | MR

[5] Kelmanov A. V., Mikhailova L. V., Khamidullin S. A., “Ob odnoi zadache poiska uporyadochennykh naborov fragmentov v chislovoi posledovatelnosti”, Diskretnyi analiz i issledovanie operatsii, 16:4 (2009), 31–46 | MR

[6] Kel'manov A. V., Jeon B., “A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train”, IEEE Trans. Sign. Proc., 52:3 (2004), 645–656 | DOI | MR

[7] Kel'manov A. V., Khamidullin S. A., “An Algorithm for Recognition of a Vector Alphabet Generating a Sequence with a Quasi-Periodic Structure”, Pattern Recognition and Image Analysis, 20:4 (2010), 451–458 | DOI

[8] Papadimitriou C. H., Computational Complexity, Addison-Wesley, New-York, 1994 | MR | Zbl

[9] Garey M. R., Johnson D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979 | MR | Zbl