On the complexity of solving bivariate systems: the case of non-singular solutions
Résumé
We give an algorithm for solving bivariate polynomial systems over either k(T)[X,Y] or Q[X,Y] using a combination of lifting and modular composition techniques.
Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|
Loading...