Rough analysis of computation trees

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)90-108
Number of pages19
JournalDiscrete Applied Mathematics
StatePublished - 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


Dive into the research topics of 'Rough analysis of computation trees'. Together they form a unique fingerprint.

Cite this