Skip to search formSkip to main contentSkip to account menu

Lucas–Lehmer–Riesel test

Known as: Lucas-Lehmer-Riesel test, LLR, Lehmer 
In mathematics, the Lucas–Lehmer–Riesel test is a primality test for numbers of the form N = k ⋅ 2n − 1, with 2n > k. The test was developed by… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Generalization of Lucas-Lehmer-Riesel primality test is introduced . 
Highly Cited
2012
Highly Cited
2012
For longer life of alternating-current (ac) machines, it is desirable to feed them by sinusoidal voltages. This can be achieved… 
Highly Cited
2012
Highly Cited
2012
In relay systems, the probability of errors occurring in the source-relay (S-R) link can be viewed as representing correlation… 
Highly Cited
2011
Highly Cited
2011
As technology continues to scale down, NAND Flash memory has been increasingly relying on error-correction codes (ECCs) to ensure… 
Highly Cited
2009
Highly Cited
2009
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO… 
Highly Cited
2005
Highly Cited
2005
My coauthors and I reply to the comments of Daniel Levin on our paper "Demand Reduction in Multiunit Auctions: Evidence from a… 
Highly Cited
2004
Highly Cited
2004
Most commonly used criteria for speaker change detection like log likelihood ratio (LLR) and Bayesian information criterion (BIC… 
Highly Cited
2001
Highly Cited
2001
Efficient implementations of the sum-product algorithm (SPA) are presented for decoding low-density parity-check (LDPC) codes… 
Highly Cited
1981
Highly Cited
1981
Semiannual, annual and some longer period changes in the rotation of the Earth have long been attributed to meteorological…