NP-hard
Mathematics and Computing
adjective
Designating an intractable problem (whether or not NP) which may be polynomially reduced to an NP-complete problem.
Origin
1970s; earliest use found in SIGACT News.
| 单词 | NP-hard |
| 释义 | NP-hardMathematics and Computing adjective Designating an intractable problem (whether or not NP) which may be polynomially reduced to an NP-complete problem. Origin |
| 随便看 |
英语词典包含243303条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。