On the complexity of solving bivariate systems: the case of non-singular solutions

Romain Lebreton; Eric Schost; Esmaeil Mehrabi

doi:10.1145/2465506.2465950

Retour

On the complexity of solving bivariate systems: the case of non-singular solutions

Acte de colloque

Open Access

On the complexity of solving bivariate systems: the case of non-singular solutions

Romain Lebreton, Eric Schost et Esmaeil Mehrabi

ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pp.251-258

ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation (Boston, United States, 26/06/2013–29/06/2013)

26/06/2013

DOI: https://doi.org/10.1145/2465506.2465950

Résumé

complexity

modular composition

bivariate polynomial systems

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.

Fichiers et liens (1)

url

Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Titre: On the complexity of solving bivariate systems: the case of non-singular solutions
Créateurs - sans rôle: Romain Lebreton - Université de Montpellier
Eric Schost - Western University
Esmaeil Mehrabi - Western University
Détails de publication: ISSAC '13: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pp.251-258
Colloque: ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation (Boston, United States, 26/06/2013–29/06/2013)
Identifiants: 9942019309311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: lirmm-00814992