Solving NP hard problems is always the bottleneck task for computer science and techniques.
求解np难问题一直是计算机科学技术中的一个瓶颈任务。
The algorithm complexity analysis shows that, to a certain extent, the algorithm could resolve the NP hard problems of attributive value reduction.
通过算法复杂度分析说明，该算法在一定程度上解决了属性值约简的NP难问题。
It is pointed out that valuable approximate algorithms can be obtained for large Numbers of NP hard problems by following the quasi-physical procedure.
这种拟物的方案可为许多NP难度的问题得出有价值的近似算法。
应用推荐