请输入您要查询的字词:

 

单词 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条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。

 

Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号 更新时间:2024/12/25 2:30:01