|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 4 of 7 found articles
| Title: |
On Average Depth of Decision Trees Implementing Boolean Functions |
| Author: |
Igor Chikalov |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 50 (2003) nr. 3-4 pages 265-284 |
| Year: |
2003-07-11 |
| Contents: |
The article considers the representation of Boolean functions in the form of decision trees. It presents the bounds on average time complexity of decision trees for all classes of Boolean functions that are closed over substitution, and the insertion and deletion of unessential variables (the structure of these classes is described in the book by Jablonsky, Gavrilov and Kudriavtzev [5]. The obtained results are compared with the results developed by Moshkov in [6] that describe the worst case time complexity of decision trees. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 4 of 7 found articles
| << previous | next >> |