Doklady Akademii Nauk, Tome 317 (1991) no. 4, pp. 850-853
Citer cet article
G. E. Naumov. $NP$-completeness of problems for constructing optimal decision trees. Doklady Akademii Nauk, Tome 317 (1991) no. 4, pp. 850-853. http://geodesic.mathdoc.fr/item/DAN_1991_317_4_a18/
@article{DAN_1991_317_4_a18,
author = {G. E. Naumov},
title = {$NP$-completeness of problems for constructing optimal decision trees},
journal = {Doklady Akademii Nauk},
pages = {850--853},
year = {1991},
volume = {317},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1991_317_4_a18/}
}
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
UR - http://geodesic.mathdoc.fr/item/DAN_1991_317_4_a18/
LA - ru
ID - DAN_1991_317_4_a18
ER -
%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
%U http://geodesic.mathdoc.fr/item/DAN_1991_317_4_a18/
%G ru
%F DAN_1991_317_4_a18
