Deterministic decision trees - Open Access .click

Results 1 to 10 of about 170,610 (66)

On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes [PDF]

Entropy, 2023
In this paper, we consider classes of conventional decision tables closed relative to the removal of attributes (columns) and changing decisions assigned to rows.
Azimkhon Ostonov, Mikhail Moshkov
openalex +2 more sources

Time and space complexity of deterministic and nondeterministic decision trees [PDF]

Annals of Mathematics and Artificial Intelligence, 2022
In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe.
Mikhail Moshkov
semanticscholar +5 more sources

Randomized versus Deterministic Decision Tree Size [PDF]

Electron. Colloquium Comput. Complex., 2023
A classic result of Nisan [SICOMP ’91] states that the deterministic decision tree *depth* complexity of every total Boolean function is at most the cube of its randomized decision tree *depth* complexity.
Arkadev Chattopadhyay +4 more
openalex +2 more sources

A Local Approach to Studying the Time and Space Complexity of Deterministic and Nondeterministic Decision Trees

arXiv.org, 2023
In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe.
Kerven Durdymyradov, Mikhail Moshkov
openalex +3 more sources

Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT [PDF]