Possible Global Upper Types of Sccf-Triples

  • Mikhail MoshkovEmail author
Part of the Intelligent Systems Reference Library book series (ISRL, volume 179)


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.


  1. 1.
    Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity, Global approach. Fundam. Inform. 25(2), 201–214 (1996)MathSciNetCrossRefGoogle Scholar
  2. 2.
    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)Google Scholar

Copyright information

© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Computer, Electrical and Mathematical Science and Engineering DivisionKing Abdullah University of Science and TechnologyThuwalSaudi Arabia

Personalised recommendations