搜索结果: 1-1 共查到“军事学 Sample Complexity”相关记录1条 . 查询时间(0.042 秒)
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
foundations
2012/3/26
We study under what conditions the conjectured one-wayness of the knapsack function (with polynomially bounded inputs) over an arbitrary finite abelian group implies that the output of the function is...