欧氏二维旅行商问题与一般指派问题的复杂性,NP不是P
The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P
摘要:
本文介绍了两个NP问题之间的区别。它集中在欧几里德二维旅行商问题和一般分配问题。主要结果是用三角形约化验证了前一个问题在多项式时间内的解,后一个问题的解是NP类的注记猜想,NP不是P.
英文摘要:
This paper presents the differences between two NP problems. It focuses in the Euclidian 2 Dimension Travelling Salesman Problems and General Assign Problems. The main results are the triangle reduction to verify the solution in polynomial time for the former and for the later the solution to the Noted Conjecture of the NP-Class, NP is not P.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。