On the complexity of solving bivariate systems: the case of non-singular solutions - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2013

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

Romain Lebreton
Connectez-vous pour contacter l'auteur
Eric Schost
  • Function : Author
  • PersonId : 839026
Esmaeil Mehrabi
  • Function : Author
  • PersonId : 940421

Abstract

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.
Fichier principal
Vignette du fichier
main.pdf (356.94 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-00814992 , version 1 (18-04-2013)

Identifiers

Cite

Romain Lebreton, Eric Schost, Esmaeil Mehrabi. On the complexity of solving bivariate systems: the case of non-singular solutions. ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.251-258, ⟨10.1145/2465506.2465950⟩. ⟨lirmm-00814992⟩
236 View
419 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More