Algorithmic Problems

Mikhail Moshkov

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

Algorithmic Problems

Mikhail Moshkov^*

^*Corresponding author for this work

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

Abstract

In the previous chapters, we considered, mainly, approximate bounds on the minimum complexity and approximate algorithms for optimization of decision trees. In this chapter, we consider algorithmic problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, and of construction of decision trees with the minimum complexity.

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

Cite this

@inbook{5db63ca581804197aed9b668fa79680a,

title = "Algorithmic Problems",

abstract = "In the previous chapters, we considered, mainly, approximate bounds on the minimum complexity and approximate algorithms for optimization of decision trees. In this chapter, we consider algorithmic problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, and of construction of decision trees with the minimum complexity.",

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

language = "English (US)",

series = "Intelligent Systems Reference Library",

publisher = "Springer",

pages = "105--115",

booktitle = "Intelligent Systems Reference Library",

address = "Germany",

}

TY - CHAP

T1 - Algorithmic Problems

AU - Moshkov, Mikhail

PY - 2020

Y1 - 2020

N2 - In the previous chapters, we considered, mainly, approximate bounds on the minimum complexity and approximate algorithms for optimization of decision trees. In this chapter, we consider algorithmic problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, and of construction of decision trees with the minimum complexity.

AB - In the previous chapters, we considered, mainly, approximate bounds on the minimum complexity and approximate algorithms for optimization of decision trees. In this chapter, we consider algorithmic problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, and of construction of decision trees with the minimum complexity.

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

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

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

M3 - Chapter

AN - SCOPUS:85083453697

T3 - Intelligent Systems Reference Library

SP - 105

EP - 115

BT - Intelligent Systems Reference Library

PB - Springer

ER -

Algorithmic Problems

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this