Skip to search formSkip to main contentSkip to account menu

Lenstra–Lenstra–Lovász lattice basis reduction algorithm

Known as: LLL basis reduction method, Lenstra–Lenstra–Lovasz lattice basis reduction algorithm, Lenstra-Lenstra-Lovasz algorithm 
The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
A two-flavor color-superconducting Nambu-Jona-Lasinio model is introduced at finite temperature T, chemical potential {mu}, and… 
2010
2010
Continuous and Discrete Methods in Computer Science.- Colorful Strips.- The Mono- and Bichromatic Empty Rectangle and Square… 
2009
2009
Distance relays used for protection of transmission lines have problems of under-reach, over-reach and maloperation due to high… 
2008
2008
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the… 
Review
2006
Review
2006
It is a pleasure to have commentaries on my review essay from two international scholars 5 of the standing of Professor Dunning… 
2005
2005
This paper considers multiple-symbol differential detection (MSD) of differential unitary space-time modulation (DUSTM) over… 
2005
2005
This paper describes an Information Extraction (IE) system to identify genic interactions in text. The approach relies on the… 
2003
2003
(ABSTRACT) High-impedance faults (HIFs) on distribution feeders are abnormal electrical conditions that cannot be detected by… 
1997
1997
We show that some RSA signature schemes using fixed or modular redundancy and dispersion of redundancy bits are insecure. Our…