一类非确定性图灵机可解问题的形式化
Formalization of the class of problems solvable by a nondeterministic Turing machine
摘要:
本文的目的是形式化NP问题的定义。将离散问题构造为带权元的独立系统的数学模型。我们引入了两个辅助集,表征问题的解决方案:伴随集,其中包含的元素从原始集合中没有一个可以邻接到已经选择的解决方案的元素;和剩余集,其中每个元素都可以邻接到以前选择的解决方案的元素。对于无前视的问题,该算法可以在多项式时间内有效地生成每一个伴随集。研究的主要结果是断言NP类与没有前瞻的问题类是相同的。因此,如果我们不能找到一个有效的(多项式时间)解决算法为一个给定的问题,那么我们需要寻找一个替代配方的问题,在一组问题没有前瞻。
英文摘要:
The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the solution of the problem: the adjoint set, which contains the elements from the original set none of which can be adjoined to the already chosen solution elements; and the residual set, in which every element can be adjoined to previously chosen solution elements. In a problem without lookahead, every adjoint set can be generated by the solution algorithm effectively, in polynomial time. The main result of the study is the assertion that the NP class is identical with the class of problems without lookahead. Hence it follows that if we fail to find an effective (polynomial-time) solution algorithm for a given problem, then we need to look for an alternative formulation of the problem in set of problems without lookahead.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。