Using the LLL-algorithm, Frank, and his student, Éva Tardos developed a general method, which could transform some polynomial time algorithms into strongly polynomial.
algorithm | RSA (algorithm) | Secure Hash Algorithm | Schönhage–Strassen algorithm | National Disaster Risk Reduction and Management Council | Luhn algorithm | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Lattice Semiconductor | László Lovász | Kosaraju's algorithm | Jan Karel Lenstra | Hendrik Lenstra | Yarrow algorithm | Violent Crime Reduction Act 2006 | sorting algorithm | Root-finding algorithm | National Disaster Risk Reduction and Management Council (NDRRMC) | Kruskal's algorithm | Generic Security Service Algorithm for Secret Key Transaction | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Algorithm | Verhoeff algorithm |
Lenstra showed that a cyclic group does not have a generic polynomial if n is divisible by eight, and Smith explicitly constructs such a polynomial in case n is not divisible by eight.