Comparitive analysis of deterministic and nondeterministic decision tree complexity. Global approach

Mikhail Moshkov

doi:10.3233/fi-1996-25205

Comparitive analysis of deterministic and nondeterministic decision tree complexity. Global approach

Mikhail Moshkov

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

We study the relationships between the complexity of a task description and the minimal complexity of deterministic and nondeterministic decision trees solving this task. We investigate decision trees assuming a global approach i.e. arbitrary checks from a given check system can be used for constructing decision trees.

Original language	English (US)
Pages (from-to)	201-214
Number of pages	14
Journal	Fundamenta Informaticae
Volume	25
Issue number	2
DOIs	https://doi.org/10.3233/fi-1996-25205
State	Published - Jan 1 1996
Externally published	Yes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21

ASJC Scopus subject areas

Computational Theory and Mathematics
Algebra and Number Theory
Theoretical Computer Science
Information Systems

Access to Document

10.3233/fi-1996-25205

Cite this

@article{b35ac86b1b564ecaab69d663a511b180,

title = "Comparitive analysis of deterministic and nondeterministic decision tree complexity. Global approach",

abstract = "We study the relationships between the complexity of a task description and the minimal complexity of deterministic and nondeterministic decision trees solving this task. We investigate decision trees assuming a global approach i.e. arbitrary checks from a given check system can be used for constructing decision trees.",

author = "Mikhail Moshkov",

note = "Generated from Scopus record by KAUST IRTS on 2023-09-21",

year = "1996",

month = jan,

day = "1",

doi = "10.3233/fi-1996-25205",

language = "English (US)",

volume = "25",

pages = "201--214",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press BV",

number = "2",

}

TY - JOUR

T1 - Comparitive analysis of deterministic and nondeterministic decision tree complexity. Global approach

AU - Moshkov, Mikhail

N1 - Generated from Scopus record by KAUST IRTS on 2023-09-21

PY - 1996/1/1

Y1 - 1996/1/1

N2 - We study the relationships between the complexity of a task description and the minimal complexity of deterministic and nondeterministic decision trees solving this task. We investigate decision trees assuming a global approach i.e. arbitrary checks from a given check system can be used for constructing decision trees.

AB - We study the relationships between the complexity of a task description and the minimal complexity of deterministic and nondeterministic decision trees solving this task. We investigate decision trees assuming a global approach i.e. arbitrary checks from a given check system can be used for constructing decision trees.

UR - https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/FI-1996-25205

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

U2 - 10.3233/fi-1996-25205

DO - 10.3233/fi-1996-25205

M3 - Article

SN - 0169-2968

VL - 25

SP - 201

EP - 214

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 2

ER -

Comparitive analysis of deterministic and nondeterministic decision tree complexity. Global approach

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this