Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables

Mikhail Moshkov

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

Lower Bounds on Complexity of Deterministic 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, 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.

Original language	English (US)
Title of host publication	Intelligent Systems Reference Library
Publisher	Springer
Pages	25-36
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-030-41728-4_3
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_3

Cite this

@inbook{dad8d7c9f0964a16915b7ccde717127c,

title = "Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables",

abstract = "In 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.",

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_3",

language = "English (US)",

series = "Intelligent Systems Reference Library",

publisher = "Springer",

pages = "25--36",

booktitle = "Intelligent Systems Reference Library",

address = "Germany",

}

TY - CHAP

T1 - Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables

AU - Moshkov, Mikhail

PY - 2020

Y1 - 2020

N2 - In 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.

AB - In 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.

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

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

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

M3 - Chapter

AN - SCOPUS:85083457778

T3 - Intelligent Systems Reference Library

SP - 25

EP - 36

BT - Intelligent Systems Reference Library

PB - Springer

ER -

Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this