algorithm | RSA (algorithm) | Secure Hash Algorithm | Schönhage–Strassen algorithm | Luhn algorithm | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | sorting algorithm | Root-finding algorithm | Mourt's Relation | Kruskal's algorithm | Generic Security Service Algorithm for Secret Key Transaction | Equivalence relation | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Algorithm | Verhoeff algorithm | Vatti clipping algorithm | Tully–Fisher relation | Tully-Fisher relation | The Descent of Man, and Selection in Relation to Sex | Sorting algorithm |
The search procedure consists of choosing a range of parameter values for s, b, and m, evaluating the sums out to many digits, and then using an integer relation finding algorithm (typically Helaman Ferguson's PSLQ algorithm) to find a vector A that adds up those intermediate sums to a well-known constant or perhaps to zero.