Algorithme de Bareiss, algorithme des sous-résultants
RAIRO-Theor. Inf. Appl., 30 4 (1996) 319-347
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Computer Algebra in Scientific Computing
Mohammadali Asadi, Alexander Brandt and Marc Moreno MazaLecture Notes in Computer Science, Computer Algebra in Scientific Computing 12865 21 (2021)
https://doi.org/10.1007/978-3-030-85165-1_3
On the complexity of the Lickteig–Roy subresultant algorithm
Grégoire LecerfJournal of Symbolic Computation 92 243 (2019)
https://doi.org/10.1016/j.jsc.2018.04.017
Multivariate subresultants in roots
Carlos D'Andrea, Teresa Krick and Agnes SzantoJournal of Algebra 302 (1) 16 (2006)
https://doi.org/10.1016/j.jalgebra.2005.08.016
Sylvester–Habicht Sequences and Fast Cauchy Index Computation
Thomas Lickteig and Marie-Françoise RoyJournal of Symbolic Computation 31 (3) 315 (2001)
https://doi.org/10.1006/jsco.2000.0427
Some Tapas of Computer Algebra
Laureano Gonzalez-Vega, Fabrice Rouillier, Marie-Françoise Roy and Guadalupe TrujilloAlgorithms and Computation in Mathematics, Some Tapas of Computer Algebra 4 121 (1999)
https://doi.org/10.1007/978-3-662-03891-8_6