一类NP问题值得寻找有效的求解算法
A class of problems of NP to be worth to search an efficient solving algorithm
摘要:
我们研究的可能性,设计一个有效的求解算法的类\np的问题。根据$k$大小的部分解在多项式时间内可扩展为$k+1$大小的部分解的性质,对\np问题进行了分类.它是一类独特的问题,值得寻找有效的求解算法.这类问题之外的问题本质上是指数级的。我们证明了哈密顿循环问题是固有的指数。
英文摘要:
We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of size $k+1$ in polynomial time. It is defined an unique class problems to be worth to search an efficient solving algorithm. The problems, which are outside of this class, are inherently exponential. We show that the Hamiltonian cycle problem is inherently exponential.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。