Abstract
The problems of estimation of the minimum average time complexity of decision trees and design of efficient algorithms are complex in general case. The upper bounds described in Chap. 2.4.3 can not be applied directly due to large computational complexity of the parameter M(z). Under reasonable assumptions about the relation of P and NP, there are no polynomial time algorithms with good approximation ratio [12, 32]. One of the possible solutions is to consider particular classes of problems and improve the existing results using characteristics of the considered classes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chikalov, I. (2011). Problems over Information Systems. In: Average Time Complexity of Decision Trees. Intelligent Systems Reference Library, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22661-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-22661-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22660-1
Online ISBN: 978-3-642-22661-8
eBook Packages: EngineeringEngineering (R0)