%0 Journal Article
%A G. E. Naumov
%T $NP$-completeness of problems for constructing optimal decision trees
%J Doklady Akademii Nauk
%D 1991
%P 850-853
%V 317
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1991_317_4_a18/
%G ru
%F DAN_1991_317_4_a18