| 单词 | NP-Hard Problem |
| 释义 | NP-Hard ProblemA problem is NP-hard if an Algorithm for solving it can be translated into one for solving any other NP-Problem(nondeterministic Polynomial time) problem. NP-hard therefore means ``at least as hard as any NP-Problem,''although it might, in fact, be harder. See also Complexity Theory, Hitting Set, NP-Complete Problem, NP-Problem, P-Problem,Satisfiability Problem |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。