Advertisement

Matrices of Lower Global Bounds

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

Abstract

In this chapter, we describe all possible 11 global lower types \(\mathrm {tp}1,\ldots ,\mathrm {tp}11\) of sccf-triples which correspond to the global upper types \(\mathrm {Tp}1,\ldots ,\mathrm {Tp}11\), respectively. We also describe all possible 10 global lower types \(\mathrm {tp}1,\ldots ,\mathrm {tp}10\) of restricted sccf-triples which correspond to the global upper types \(\mathrm {Tp}1,\ldots ,\mathrm {Tp}10\). For a given signature \(\rho \), each global lower type \(\mathrm {tp}i\), \(i \in \{1, \ldots ,10\}\), 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 \(\varPhi _{\tau }^{bc}\) true for any sccf-triple \(\tau \in W_{\rho }(i)\).

Reference

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