Rough analysis of computation trees

Mikhail Moshkov

doi:10.1016/j.dam.2022.06.032

Rough analysis of computation trees

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

Abstract

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.

Original language	English (US)
Pages (from-to)	90-108
Number of pages	19
Journal	Discrete Applied Mathematics
Volume	321
DOIs	https://doi.org/10.1016/j.dam.2022.06.032
State	Published - Jul 2 2022

Bibliographical note

KAUST Repository Item: Exported on 2022-09-14
Acknowledgements: Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST), Saudi Arabia. The author is grateful to the anonymous reviewer for useful comments and suggestions.

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2022.06.032

https://repository.kaust.edu.sa/bitstream/10754/674932/5/1-s2.0-S0166218X22002268-main.pdf

Cite this

@article{589e9df3cf8d4eab8caaeacd45dc608c,

title = "Rough analysis of computation trees",

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

author = "Mikhail Moshkov",

note = "KAUST Repository Item: Exported on 2022-09-14 Acknowledgements: Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST), Saudi Arabia. The author is grateful to the anonymous reviewer for useful comments and suggestions.",

year = "2022",

month = jul,

day = "2",

doi = "10.1016/j.dam.2022.06.032",

language = "English (US)",

volume = "321",

pages = "90--108",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Rough analysis of computation trees

AU - Moshkov, Mikhail

N1 - KAUST Repository Item: Exported on 2022-09-14 Acknowledgements: Research reported in this publication was supported by King Abdullah University of Science and Technology (KAUST), Saudi Arabia. The author is grateful to the anonymous reviewer for useful comments and suggestions.

PY - 2022/7/2

Y1 - 2022/7/2

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

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

UR - http://hdl.handle.net/10754/674932

UR - https://linkinghub.elsevier.com/retrieve/pii/S0166218X22002268

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

U2 - 10.1016/j.dam.2022.06.032

DO - 10.1016/j.dam.2022.06.032

M3 - Article

SN - 0166-218X

VL - 321

SP - 90

EP - 108

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Rough analysis of computation trees

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this