• The fill in problem for graphs is a well known NP hard problem.

    的最小填充问题熟知NP-困难问题。

    youdao

  • Power network planning is a NP hard problem difficult to be solved.

    电网规划一个解决NP问题

    youdao

  • Automatic test paper generation is a NP hard problem while restrictions exist.

    试题库自动组卷问题一个NP难题。

    youdao

  • Test set problem is a NP-hard problem with wide applications.

    测试问题一个有着广泛应用NP难问题。

    youdao

  • Recent studies show that the problem is NP-hard.

    最近研究成果表明这一问题NP难问题。

    youdao

  • We show that the scheduling problem is NP-hard in the strong sense.

    本文证明了上述排序模型NP困难

    youdao

  • We show that the scheduling problem is NP-hard in the strong sense.

    本文证明了上述排序模型NP困难

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定