搜索结果: 1-1 共查到“军事学 Admit Logarithmic Worst-Case”相关记录1条 . 查询时间(0.046 秒)
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors
Lattices Admit Logarithmic Worst-Case Average-Case Connection Factors
2009/1/5
We demonstrate an average-case problem which is as hard as finding
(n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where
(n) = O(plog n).The previously best k...