“NP-complete problem”的概念、定义、翻译、参考文献-科学参考

单词	NP-complete problem
释义	NP-complete problem [¦en¦pē kǝm`plēt ´präb·lǝm] ^{COMPUTER SCIENCE} One of the hardest problems in class NP, such that, if there are any problems in class NP but not in class P, this is one of them.
随便看	truncated distribution truncated landform truncated paraboloid truncated prism truncated pyramid truncation truncation error truncus arteriosis trunk trunk buoy trunk circuit trunk exchange trunk feeder trunk group trunk height trunk roadway trunk sewer trunk stream trunnion truss truss bridge trussed beam trussed rafter truss rod truth

科学参考收录了103327条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。