| 单词 | knapsack problem |
| 释义 | knapsack problem [`nap´sak ´präb·lǝm] MATHEMATICS The problem, given a set of integers {A1, A2, . . ., An} and a target integer B, of determining whether a subset of the Ai can be selected without repetition so that their sum is the target B. |
| 随便看 |
|
科学参考收录了103327条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。