Abstract
In this chapter, we describe all possible 11 global upper types \(\mathrm {Tp}1, \ldots , \mathrm {Tp}11\) of sccf-triples and all possible 10 global upper types \(\mathrm {Tp}1, \ldots , \mathrm {Tp}10\) of restricted sccf-triples. For each of the last 10 global upper types, we consider the criterion of its implementation for restricted sccf-triples.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity, Global approach. Fundam. Inform. 25(2), 201–214 (1996)
Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III, Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer, Berlin (2005)
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). Possible Global Upper Types of Sccf-Triples. 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_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_21
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)