搜索结果: 1-1 共查到“泛函分析 Lattice Algorithms”相关记录1条 . 查询时间(0.095 秒)
Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
Approximate M-Ellipsoid Lattice Algorithms Computational Complexity
2011/10/9
Abstract: We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^O(n) for g...