Unverified50% confidenceFactExact time
L² reduction (floating-point LLL) was proposed by Phong Q. Nguyen and Damien Stehlé, and their paper "Floating-Point LLL Revisited" was published in 2005.
1
Sources
50%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
L2约简算法详解：Python实现二次复杂度LLL格约简
Related Claims
UnverifiedNguyen 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.58% similarVerifiedAt the end of 2023, Terence Tao and collaborators used Lean and LLM assistance to prove an important special case of the polynomial Freiman-Ruzsa conjecture57% similarUnverified数学家Jaeger在1985年证明了循环双覆盖猜想的弱化版本「5-环覆盖猜想」56% similarUnverifiedThe LLL algorithm is named after its inventors Lenstra, Lenstra, and Lovász, was proposed in 1982, and can find a reduced basis in polynomial time.52% similarUnverified检查点机制的理论基础可追溯至1985年由Chandy和Lamport提出的分布式快照算法50% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/683649API
curl https://kongchang.com/api/v1/knowledge/claims/683649MCP
get_claim(id=683649)