Abstract
In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property \(\varLambda 2\). The considered algorithms require complexity functions having properties \(\varLambda 1\), \(\varLambda 2\), and \(\varLambda 3\).
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
Reference
Moshkov, M.: About the depth of decision trees computing Boolean functions. Fundam. Inform. 22(3), 203–215 (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Moshkov, M. (2020). Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables. In: Comparative Analysis of Deterministic and Nondeterministic Decision Trees. Intelligent Systems Reference Library, vol 179. Springer, Cham. https://doi.org/10.1007/978-3-030-41728-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41727-7
Online ISBN: 978-3-030-41728-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)