• 1. NP - hard problem: NP完全问题
• 2. NP-hard problem: NP困难问题 | 困难问题 | NP难度问题
• 3. NP hard problem: NP难问题 | np难

更多释义

• 1.In the last, the paper designs and analyses the Graph Theory algorithm and drives a conclusion that the problem of the arranging of curriculum schedule is NP - hard problem.
  在文章的最后我们对课表超图的图论算法进行设计与分析，并得出该问题是一个NP难问题。
  dict.yoduao.com
• 2.The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
  带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
  dict.yoduao.com
• 3.The fill in problem for graphs is a well known NP hard problem.
  图的最小填充问题是熟知的NP-困难问题。
  dict.yoduao.com

©2026 网易公司