Abstract
In this chapter, we describe all possible six local lower types \(\mathrm {tp}1,\ldots ,\mathrm {tp}6\) of restricted sccf-triples which correspond to the local upper types \(\mathrm {Tp}1,\ldots ,\mathrm {Tp}6\), respectively. For a given signature \(\rho \), each local lower type \(\mathrm {tp}i\), \(i \in \{1, \ldots ,6\}\), and 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 \(\mu \) or \(\gamma \) stays, we study upper and lower bounds on the function \(\hat{\Phi }_{\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). Matrices of Lower Local Bounds. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_15
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)