TY  - JOUR
AU  - G. E. Naumov
TI  - $NP$-completeness of problems for constructing optimal decision trees
JO  - Doklady Akademii Nauk
PY  - 1991
SP  - 850
EP  - 853
VL  - 317
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1991_317_4_a18/
LA  - ru
ID  - DAN_1991_317_4_a18
ER  -