@inbook{62e54a8f6b76443fadf74f18c7c35ce0,
title = "Closed Classes of Boolean Functions",
abstract = "In this chapter, for decision tables corresponding to functions from an arbitrary closed class of Boolean functions, the depth of deterministic, nondeterministic, and strongly nondeterministic decision trees is studied. The obtained results have some independent interest. Proofs of these results illustrate mainly methods for the proof of lower bounds on complexity of decision trees.",
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_7",
language = "English (US)",
series = "Intelligent Systems Reference Library",
publisher = "Springer",
pages = "93--103",
booktitle = "Intelligent Systems Reference Library",
address = "Germany",
}