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 -