Geodesic
On the implementation complexity of discrete (logical) recognition procedures
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 3, pp. 562-572 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2004_44_3_a16,
     author = {E. V. Dyukova},
     title = {On the implementation complexity of discrete (logical) recognition procedures},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {562--572},
     year = {2004},
     volume = {44},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_3_a16/}
}
TY  - JOUR
AU  - E. V. Dyukova
TI  - On the implementation complexity of discrete (logical) recognition procedures
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2004
SP  - 562
EP  - 572
VL  - 44
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_3_a16/
LA  - ru
ID  - ZVMMF_2004_44_3_a16
ER  - 
%0 Journal Article
%A E. V. Dyukova
%T On the implementation complexity of discrete (logical) recognition procedures
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2004
%P 562-572
%V 44
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_3_a16/
%G ru
%F ZVMMF_2004_44_3_a16
E. V. Dyukova. On the implementation complexity of discrete (logical) recognition procedures. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 44 (2004) no. 3, pp. 562-572. http://geodesic.mathdoc.fr/item/ZVMMF_2004_44_3_a16/

[1] Baskakova L. V., Zhuravlev Yu. I., “Model raspoznayuschikh algoritmov s predstavitelnymi naborami i sistemami opornykh mnozhestv”, Zh. vychisl. matem. i matem. fiz., 21:5 (1981), 1264–1275 | MR | Zbl

[2] Dmitriev A. I., Zhuravlev Yu. I., Krendelev F. P., “O matematicheskikh printsipakh klassifikatsii predmetov ili yavlenii”, Diskretnyi analiz, 7, IM SO AN SSSR, Novosibirsk, 1966, 3–17

[3] Dyukova E. V., “Ob asimptoticheski optimalnom algoritme postroeniya tupikovykh testov”, Dokl. AN SSSR, 233:4 (1977), 527–530 | MR | Zbl

[4] Dyukova E. V., “Asimptoticheski optimalnye testovye algoritmy v zadachakh raspoznavaniya”, Probl. kibernetiki, 39, Nauka, M., 1982, 165–199 | MR

[5] Dyukova E. V., “O slozhnosti realizatsii nekotorykh protsedur raspoznavaniya”, Zh. vychisl. matem. i matem. fiz., 27:1 (1987), 114–127 | MR | Zbl

[6] Dyukova E. V., “Algoritmy raspoznavaniya tipa Kora: slozhnost realizatsii i metricheskie svoistva”, Matem. metody i ikh primenenie, Raspoznavanie, klassifikatsiya, prognoz, 2, Nauka, M., 1989, 99–125 | MR

[7] Dyukova E. V., Zhuravlev Yu. I., “Diskretnyi analiz priznakovykh opisanii v zadachakh raspoznavaniya bolshoi razmernosti”, Zh. vychisl. matem. i matem. fiz., 40:8 (2000), 1264–1278 | MR | Zbl

[8] Djukova E. V., “Discrete recognition procedures: the complexity of realization”, Pattern Recognition and Image Analys., 13:1 (2003), 8–10

[9] Dyukova E. B., Peskov H. B., “Poisk informativnykh fragmentov opisanii ob'ektov v diskretnykh protsedurakh raspoznavaniya”, Zh. vychisl. matem. i matem. fiz., 42:5 (2002), 741–753 | MR | Zbl

[10] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya ili klassifikatsii”, Probl. kibernetiki, 33, Nauka, M., 1978, 5–68

[11] Yablonskii S. V., Vvedenie v diskretnuyu matematiku, Nauka, M., 1986 | MR

[12] Kuznetsov S. O., “Avtomaticheskoe obuchenie na osnove analiza formalnykh ponyatii”, Avtomatika i telemekhan., 2001, no. 10, 3–27 | Zbl

[13] Jonson D. S., Yannakakis M., Papadimitriou C. H., “On general all maximal independent sets”, Information Proc. Letts., 27 (1988), 119–123 | DOI | MR