You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The best thing to do might just be to implement polynomial factorization over $\mathbb{Q}(a)$ with the standard algorithm. Then one can just compute nth roots by factoring $x^n-c$.
There is a WIP implementation of square roots in flintlib/antic#51 which apparently needs some more work.
The text was updated successfully, but these errors were encountered: