It belongs to NP complete problem in theory, so it's hard to solve in practical problems.

在理论上属于NP完全问题，在实际问题上很难解决。

youdao

As the minimum feedback vertex set problem is NP-complete, it is hard to be solved exactly.

最小反馈节点集问题是一个NP完全问题，很难准确求解。

youdao

Since the time order and the data dependence exist in the grid workflow, the workflow scheduling in grid is a complete NP-hard.

由于网格工作流任务之间存在时序和数据依赖等关系，使得网格环境中工作流的调度问题成为一个NP完全问题。

youdao