Bounds Inside Types

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


In this chapter, for a given signature \(\rho \) and each possible local upper type of restricted sccf-triples \(\mathrm {Tp}i\), \(i \in \{1, \ldots ,6\}\), we consider the set \(\hat{W}_{\rho }(i)\) of restricted sccf-triples \(\tau \) with \(\mathrm {Typ}\;\hat{\varPsi }_{\tau }=\mathrm {Tp}i\). For each pair \((b,c)\in \{i,d,a,s\}^{2}\) such that in the matrix \(\mathrm {Tp}i\) at the intersection of the row with index b and the column with index c either \(\lambda \) or \(\chi \) stays, we study upper and lower bounds on the function \(\hat{\varPsi }_{\tau }^{bc}\) true for any sccf-triple \(\tau \in \hat{W}_{\rho }(i)\).


  1. 1.
    Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity. Local approach. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV, Lecture Notes in Computer Science, vol. 3700, pp. 125–143. 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