@inbook{c1b2d0d0887c48db8f7fbafad3d7ae1f,
title = "Upper Bounds and Algorithms for Construction of Deterministic Decision Trees for Decision Tables. Second Approach",
abstract = "In this chapter, upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called additive-bounded uncertainty measures for decision tables. The bounds are true for any complexity function having the property When developing algorithms, we assume that the complexity functions have properties.",
author = "Mikhail Moshkov",
note = "Publisher Copyright: {\textcopyright} 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.",
year = "2020",
doi = "10.1007/978-3-030-41728-4_5",
language = "English (US)",
series = "Intelligent Systems Reference Library",
publisher = "Springer",
pages = "65--84",
booktitle = "Intelligent Systems Reference Library",
address = "Germany",
}