Unverified50% confidenceFactExact time
The 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.
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 conjecture69% similarUnverified检查点机制的理论基础可追溯至1985年由Chandy和Lamport提出的分布式快照算法64% similarUnverifiedIsosurface extraction is based on the Marching Cubes algorithm, which was proposed by Lorensen and Cline in 1987.60% similarUnverifiedThe SIKE scheme based on supersingular isogeny mappings was broken in 2022 by Wouter Castryck and Thomas Decru using a classical algorithm within a matter of hours59% similarUnverified史蒂芬·沃尔夫拉姆在1980年代对一维初等元胞自动机进行了系统性分类，将所有256种一维二值规则归入四大行为类别58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/683646API
curl https://kongchang.com/api/v1/knowledge/claims/683646MCP
get_claim(id=683646)