Geodesic
An algorithm for constructing irredundant tests for binary tables
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 4, pp. 698-704 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1998_38_4_a18,
     author = {Kh. A. Madatyan},
     title = {An algorithm for constructing irredundant tests for binary tables},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {698--704},
     year = {1998},
     volume = {38},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_4_a18/}
}
TY  - JOUR
AU  - Kh. A. Madatyan
TI  - An algorithm for constructing irredundant tests for binary tables
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1998
SP  - 698
EP  - 704
VL  - 38
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_4_a18/
LA  - ru
ID  - ZVMMF_1998_38_4_a18
ER  - 
%0 Journal Article
%A Kh. A. Madatyan
%T An algorithm for constructing irredundant tests for binary tables
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1998
%P 698-704
%V 38
%N 4
%U http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_4_a18/
%G ru
%F ZVMMF_1998_38_4_a18
Kh. A. Madatyan. An algorithm for constructing irredundant tests for binary tables. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 4, pp. 698-704. http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_4_a18/

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

[2] Slutskaya T. L., “Algoritmy vychisleniya informatsionnykh vesov priznakov”, Diskretnyi analiz, 12, Nauka, Novosibirsk, 1968, 75–90

[3] Konstantinov P. M., Koroleva Z. E., Kudryavtsev V. B., “O kombinatorno-logicheskom podkhode k zadacham prognoza rudonosnosti”, Probl. kibernetiki, 31, Nauka, M., 1975, 5–33

[4] Dyukova E. V., “Ob asimptoticheski optimalnom algoritme postroeniya tupikovykh testov dlya binarnykh tablits”, Probl. kibernetiki, 34, Nauka, M., 1978, 169–186 | MR

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

[6] Madatyan Kh. A., “O tupikovykh testakh dlya binarnykh tablits”, Zh. vychisl. matem. i matem. fiz., 37:2 (1997), 243–249 | MR | Zbl

[7] Chegis A. I., Yablonskii S. V., “Logicheskie sposoby kontrolya elektricheskikh skhem”, Tr. MIAN SSSR, 51, M., 1958, 270–360

[8] Leontev V. K., “Verkhnyaya otsenka $\alpha$-glubiny (0,1)-matrits”, Matem. zametki, 15:3 (1974), 421–429 | MR