Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables

Mikhail Moshkov

doi:10.1007/978-3-030-41728-4_6

Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables

Mikhail Moshkov^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property The considered algorithms require complexity functions having properties.

Original language	English (US)
Title of host publication	Intelligent Systems Reference Library
Publisher	Springer
Pages	85-91
Number of pages	7
DOIs	https://doi.org/10.1007/978-3-030-41728-4_6
State	Published - 2020

Publication series

Name	Intelligent Systems Reference Library
Volume	179
ISSN (Print)	1868-4394
ISSN (Electronic)	1868-4408

Bibliographical note

Publisher Copyright:
© 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.

ASJC Scopus subject areas

General Computer Science
Information Systems and Management
Library and Information Sciences

Access to Document

10.1007/978-3-030-41728-4_6

Cite this

@inbook{0350d66b66c24f479ba4b662139fc5db,

title = "Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables",

abstract = "In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property The considered algorithms require complexity functions having 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_6",

language = "English (US)",

series = "Intelligent Systems Reference Library",

publisher = "Springer",

pages = "85--91",

booktitle = "Intelligent Systems Reference Library",

address = "Germany",

}

TY - CHAP

T1 - Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables

AU - Moshkov, Mikhail

PY - 2020

Y1 - 2020

N2 - In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property The considered algorithms require complexity functions having properties.

AB - In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property The considered algorithms require complexity functions having properties.

UR - http://www.scopus.com/inward/record.url?scp=85083449828&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-41728-4_6

DO - 10.1007/978-3-030-41728-4_6

M3 - Chapter

AN - SCOPUS:85083449828

T3 - Intelligent Systems Reference Library

SP - 85

EP - 91

BT - Intelligent Systems Reference Library

PB - Springer

ER -

Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this