Abstract
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)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
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)
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 Inside Types. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_14
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)