Abstract
We consider decision trees with questions from an infinite set and time complexity measures. We investigate decidability conditions for two optimization problems for decision trees.
Original language | English (US) |
---|---|
Pages (from-to) | 391-401 |
Number of pages | 11 |
Journal | Fundamenta Informaticae |
Volume | 21 |
Issue number | 4 |
DOIs | |
State | Published - 1994 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- Information Systems
- Computational Theory and Mathematics