Asymptotics of Random-Lattice Enumeration: Beyond HKZ via Dense Sublattices
To bridge the gap between worst-case and heuristic analyses of lattice enumeration, we study the sizes of (unpruned) enu
#math.MG
共收录 2 条相关情报。
← 返回所有主题A Note on Sphere Packing Bounds for Tuple Lattice Sieving
本文研究了一类与格筛法（lattice sieving）相关的几何组合问题，具体关注“元组格筛法”（tuple lattice sieving）中的球堆积（sphere packing）界。作者首先定义了“k-不可约”单位向量集：任意二到k