p-np question pnp问题
For general graph, it is a NP-hard question to get the bondage number or reinforcement number.
对一般的图，求其绑定数和增强数是NP -困难问题，在本文中我们求出了两类图的绑定数和增强数。
The job-shop scheduling research belongs to the combination optimization category, it is the typical NP difficult question, its research has great theory significance and practical significance.
车间作业调度研究属于组合优化范畴，是典型的NP难问题，对它的研究具有重大的理论意义和现实意义。
应用推荐