论文标题
计算树的粗略分析
Rough analysis of computation trees
论文作者
论文摘要
本文介绍了由一个任意结构组成的计算树，该结构由集合以及在其上定义的函数和谓词集合。它致力于对此结构的$ n $输入变量的三个问题的比较分析：问题描述的复杂性，计算树的最小复杂性确定性解决此问题以及计算树的最小复杂性解决此问题，以无效解决此问题。考虑这些参数之间的关系粗略分类，并列举了所有可能的七种关系。研究了随着输入变量的数字$ n $的增长的关系类型的变化。
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.
