Titlebook: Comparative Analysis of Deterministic and Nondeterministic Decision Trees; Mikhail Moshkov Book 2020 The Editor(s) (if applicable) and The

trigger

歌劇等

Cornelia Kricheldorff Dr. phil., Dipl.This chapter contains definitions of the notions of decision table with many-valued decisions, decision tree schema, deterministic, nondeterministic, and strongly nondeterministic decision trees for decision tables, and complexity function.

蔑視

Annotate

時(shí)代

https://doi.org/10.1007/978-3-531-90619-5In this chapter, for restricted sccf-triples ., we study functions ., ., located in the matrix of upper local bounds for the triple . on the main diagonal and below. For each of these functions, we list all possible upper types and consider criterion for each such type. In several cases, we give upper and lower bounds for the considered functions.

Anthrp

駭人

Sozialer Raum und Soziale ArbeitIn this chapter, we describe all possible six local upper types of restricted sccf-triples. For each of these six types, we consider the criterion of its implementation and give an example of a restricted sccf-triple with this type.

神化怪物

commonsense

Basic Definitions and NotationThis chapter contains definitions of the notions of decision table with many-valued decisions, decision tree schema, deterministic, nondeterministic, and strongly nondeterministic decision trees for decision tables, and complexity function.

字謎游戲

Lower Bounds on Complexity of Deterministic Decision Trees for Decision TablesIn this chapter, lower bounds on complexity of deterministic decision trees for decision tables are studied that are based on the notions of super-cover, super-partition, test, and system of representatives for decision tables. An approach to the proof of lower bounds is also considered which is based on the use of so-called proof-trees.