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
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
Exact Computing
Eric Schost
  • Function : Author
  • PersonId : 839026
Computer Science Department [Ontario]
Esmaeil Mehrabi
  • Function : Author
  • PersonId : 940421
Computer Science Department [Ontario]

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.

Domains

Symbolic Computation [cs.SC] Computational Complexity [cs.CC]
Fichier principal
Vignette du fichier
main.pdf (356.94 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Romain Lebreton  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00814992

Submitted on : Thursday, April 18, 2013-9:45:17 AM

Last modification on : Wednesday, February 7, 2024-5:16:04 PM

Long-term archiving on : Monday, April 3, 2017-6:48:52 AM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ECO LIRMM MIPS UNIV-MONTPELLIER ANR
243 View
432 Download

Altmetric

Share

More