Abstract
The paper is devoted to investigation of behavior of global Shannon functions which produce unimprovable upper bounds on time complexity of decision trees over arbitrary information systems.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 157-184 |
| Number of pages | 28 |
| Journal | Fundamenta Informaticae |
| Volume | 31 |
| Issue number | 2 |
| DOIs | |
| State | Published - Aug 1997 |
| Externally published | Yes |
Keywords
- Decision tree
- Information system
- Time complexity
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- Information Systems
- Computational Theory and Mathematics