Abstract
Lower and upper bounds for the depth of decision trees computing Boolean functions are established and Shannon functions of the decision tree depth are determined for closed classes of Boolean functions.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 203-205 |
| Number of pages | 3 |
| Journal | Fundamenta Informaticae |
| Volume | 22 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1995 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- Information Systems
- Computational Theory and Mathematics