Rough analysis of computation trees

01/02/2022
by   Mikhail Moshkov, et al.
0

This paper deals with computation trees over an arbitrary structure consisting of a set along with collections of functions and predicates that are defined on it. It is devoted to the comparative analysis of three parameters of problems with n input variables over this structure: the complexity of a problem description, the minimum complexity of a computation tree solving this problem deterministically, and the minimum complexity of a computation tree solving this problem nondeterministically. Rough classification of relationships among these parameters is considered and all possible seven types of these relations are enumerated. The changes of relation types with the growth of the number n of input variables are studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2023

Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes

In this paper, we consider classes of decision tables with many-valued d...
research
08/21/2017

On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs

Minimum Bisection denotes the NP-hard problem to partition the vertex se...
research
01/13/2022

Exact learning for infinite families of concepts

In this paper, based on results of exact learning, test theory, and roug...
research
01/06/2022

Decision trees for regular factorial languages

In this paper, we study arbitrary regular factorial languages over a fin...
research
01/12/2022

Exact learning and test theory

In this paper, based on results of exact learning and test theory, we st...
research
03/27/2013

The Recovery of Causal Poly-Trees from Statistical Data

Poly-trees are singly connected causal networks in which variables may a...

Please sign up or login with your details

Forgot password? Click here to reset