Voir la notice de l'article provenant de la source Math-Net.Ru
[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