subset sum problem 子集合加总问题 ; [数] 子集和问题 ; 子集总和问题
subset-sum 子集和
subset sum problems 子集和问题
Low density subset-sum attack 低密度子集和攻击
Sum of Subset Problem 子集和问题
It is basically a 2d variation of the Subset Sum Problem.
它基本上是一个二维的变化子集和问题。
Note however, there is a pseudo-polynomial dynamic programming solution to subset sum that might be utilized here as well.
然而，有一个伪多项式时间的动态规划的解决方案的子集这可能被利用在这里就好了。
The cryptosystem obtains a high knapsack density, and hence it is secure against low density subset-sum attack.
该公钥密码体制具有较高的背包密度，因此可以抵抗低密度子集和攻击。
应用推荐