The power series composition in FLINT currently relies on the Brent–Kung baby‑step giant‑step algorithm. For…
The power series composition in FLINT currently relies on the Brent–Kung baby‑step giant‑step algorithm. For…: a task in LegoFlow-SWE (Harbor dataset). The Kinoshita–Li algorithm (https://arxiv.org/abs/2404.05177) achieves near‑linear time and O(n log n) memory, making it a desirable addition for…
The task
The Kinoshita–Li algorithm (https://arxiv.org/abs/2404.05177) achieves near‑linear time and O(n log n) memory, making it a desirable addition for composition over generic rings. The issue is to add this algorithm as a new public interface.
Part of Lego-X/LegoFlow-SWE.