Advertisement

Realizable Global Upper Types of Sccf-Triples

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

Abstract

In this chapter, for each \(i \in \{1, \ldots , 11\}\), we prove that there exists a sccf-triple \(\tau \) such that \(\mathrm {Typ}\;\varPsi _{\tau }=\mathrm {Tp}i\). We also prove that, for each \(i \in \{1, \ldots , 10\}\), there exists a restricted sccf-triple \(\tau \) such that \(\mathrm {Typ}\;\varPsi _{\tau }=\mathrm {Tp}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