An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables. Unfortunately, it is numerically unstable and therefore requires extremely high numeric precision. The cause of this instability is not known, but is believed to derive from its reliance on Gram-Schmidt orthonormalization, which is known to be numerically unstable (Golub and Van Loan 1989). Rössner and Schnorr have developed a stable variation of HJLS .

Ferguson-Forcade algorithm | Gram-Schmidt orthonormalization | integer relation | LLL algorithm | PSLQ algorithm | PSOS algorithm