| 单词 | np-completeness |
| 释义 | > as lemmasNP-completeness NP-completeness n. the condition of a problem of being NP-complete. ΚΠ 1976 Computing 16 263 (title) The NP-completeness of the bandwidth minimization problem. 1994 SIAM Rev. 36 157 The notion of NP-completeness has helped researchers in several fields to argue that some problems are intrinsically difficult to solve computationally. < as lemmas |
| 随便看 |
英语词典包含1132095条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。