Unverified50% confidenceFactExact time
Nguyen and Stehlé proved that as long as the floating-point precision satisfies a dimension-dependent lower bound (approximately O(n) bits of floating-point mantissa precision), the correctness of each step of the LLL algorithm is guaranteed.
1
Sources
50%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
L2约简算法详解：Python实现二次复杂度LLL格约简
Related Claims
VerifiedAt the end of 2023, Terence Tao and collaborators used Lean and LLM assistance to prove an important special case of the polynomial Freiman-Ruzsa conjecture61% similarUnverified指针分析经典算法中，Andersen 分析精度更高但计算复杂度达 O(n³)，Steensgaard 分析近乎线性但精度较低60% similarUnverified傅里叶神经算子（FNO）由Zongyi Li等人于2020年提出，学习的是无穷维函数空间之间的映射，能以比传统数值方法快数个数量级的速度求解偏微分方程59% similarUnverifiedL² reduction (floating-point LLL) was proposed by Phong Q. Nguyen and Damien Stehlé, and their paper "Floating-Point LLL Revisited" was published in 2005.58% similarUnverifiedTerence Tao collaborated with Ben Green to prove the Green-Tao theorem, which states that the prime numbers contain arbitrarily long arithmetic progressions.57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/683650API
curl https://kongchang.com/api/v1/knowledge/claims/683650MCP
get_claim(id=683650)