On Average Time Complexity of Decision Trees and Branching Programs

Authors:
Igor Chikalov
Affiliations:
(Correspd.) Faculty of Calculating Mathematics and Cybernetics, Nizhni Novgorod State University, 23, Gagarina Av., Nizhni Novgorod, 603600, Russia. igor@nstl.nnov.ru
Venue:
Fundamenta Informaticae
Year:
1999

Citing 6
Cited 0

The complexity of Boolean functions

The complexity of Boolean functions
On the complexity of branching programs and decision trees for clique functions

Journal of the ACM (JACM)
Restricted branching programs and hardware verification

Restricted branching programs and hardware verification
An Exponential Lower Bound for One-Time-Only Branching Programs

Proceedings of the Mathematical Foundations of Computer Science 1984
On Decision Trees with Minimal Average Depth

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Bounds on Average Weighted Depth of Decision Trees

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper contains some results concerning the properties of decision trees with minimal average depth. The sufficient conditions, which allows for performing a decomposition of problem are given. The class of all information systems, which have linear upper bounds on minimal average weighted depth depending only on entropy, is described. The exponential lower bounds on the number of vertices in branching programs with minimal average weighted depth for some problems are obtained.