Skip to Main content Skip to Navigation
Conference papers

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

Romain Lebreton 1, * Eric Schost 2 Esmaeil Mehrabi 2
* Corresponding author
1 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00814992
Contributor : Romain Lebreton <>
Submitted on : Thursday, April 18, 2013 - 9:45:17 AM
Last modification on : Thursday, July 5, 2018 - 3:56:40 PM
Long-term archiving on: : Monday, April 3, 2017 - 6:48:52 AM

File

main.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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

Share

Metrics

Record views

367

Files downloads

650