Dokl. Akad. Nauk SSSR, 1991 Volume 317, Number 4, Pages 850–853
(Mi dan6116)
|
CYBERNETICS AND THE REGULATION THEORY
$NP$-completeness of problems for constructing optimal decision trees
G. E. Naumov All-Union Research Institute for the development of software for computer technology, Rostov-on-Don
UDC:
518.2
Presented: G. S. PospelovReceived: 20.11.1990
English version:
Doklady Mathematics, 1991,
36:4,
270–271
Bibliographic databases:
© , 2024
Fulltext:
PDF file (280 kB)