Ensembles triangulaires de polynômes et résolution de systèmes algébriques. Implantation en Axiom, 1999. ,
On the Theories of Triangular Sets, Journal of Symbolic Computation, vol.28, issue.1-2, pp.105-124, 1999. ,
DOI : 10.1006/jsco.1999.0269
URL : https://hal.archives-ouvertes.fr/hal-01148870
Gröbner Bases: a computational approach to commutative algebra, Graduate Texts in Mathematics, vol.141, 1991. ,
Cours de mathématiquesmathématiquesà l'usage des Gardes du Pavillon et de la Marine, volume III, p.1766 ,
´ Etude et implantation de quelques algorithmes en algèbre différentielle, 1994. ,
Efficient computation of regular differential systems by change of rankings using Kähler differentials, pp.99-113, 1999. ,
Representation for the radical of a finitely generated differential ideal, Proceedings of the 1995 international symposium on Symbolic and algebraic computation , ISSAC '95, pp.158-166, 1995. ,
DOI : 10.1145/220346.220367
URL : https://hal.archives-ouvertes.fr/hal-00138020
Computing representations for radicals of finitely generated differential ideals, Applicable Algebra in Engineering, Communication and Computing, vol.3, issue.1, 1997. ,
DOI : 10.1007/s00200-009-0091-7
URL : https://hal.archives-ouvertes.fr/hal-00820902
Unmixed-dimensional Decomposition of a Finitely Generated Perfect Differential Ideal, Journal of Symbolic Computation, vol.31, issue.6, 1996. ,
DOI : 10.1006/jsco.1999.1562
An Algorithm for Finding a Basis for the Residue Class Ring of a Zero?Dimensional Polynomial Ideal (German), Math. Inst. Univ. of Innsbruck, 1965. ,
About a new method for computing in algebraic number fields, Proceedings of EUROCAL85, pp.289-290, 1985. ,
Optimizations of the subresultant algorithm, Journal of Pure and Applied Algebra, vol.145, issue.2, 1998. ,
DOI : 10.1016/S0022-4049(98)00081-4
Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Mathematics, vol.150, 1995. ,
Efficient computation of Gröbner bases by change of orderings Factorization free decomposition algorithms in differential algebra, Journal of Symbolic Computation, pp.329-344, 1993. ,
A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties, Journal of Symbolic Computation, vol.15, issue.2, pp.143-167, 1993. ,
DOI : 10.1006/jsco.1993.1011
The art of computer programming, 1966. ,
Differential Algebra and Algebraic Groups, 1973. ,
Theorie der endlichen und unendlichen Graphen, 1950. ,
Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, vol.13, issue.2, pp.117-131, 1992. ,
DOI : 10.1016/S0747-7171(08)80086-7
URL : http://doi.org/10.1016/s0747-7171(08)80086-7
Coherent, regular and simple systems in zero decompositions of partial differential systems, Systems Science and Mathematical Sciences, vol.12, pp.43-60, 1999. ,
Polynomial gcd computations over towers of algebraic extensions, Proceedings of AAECC11, pp.365-382, 1995. ,
DOI : 10.1007/3-540-60114-7_28
Calculs de Pgcd au?dessus des Tours d'Extensions Simples et Résolution des Systèmes d' ´ Equations Algébriques, 1997. ,
The Differential Ideal [ P ] : M???, Journal of Symbolic Computation, vol.28, issue.4-5, pp.631-656, 1999. ,
DOI : 10.1006/jsco.1999.0318
Leprobì eme de l'identifiabilité structurelle globale : approche théorique, méthodes effectives et bornes de complexité, 1990. ,
Differential Algebra, 1950. ,
DOI : 10.1090/coll/033
Specializations in differential algebra, Transactions of the American Mathematical Society, vol.90, issue.3, pp.394-407, 1959. ,
DOI : 10.1090/S0002-9947-1959-0107642-2
A construction of radical ideals in polynomial algebra, 1995. ,
An elimination theory for differential algebra, Univ. California Publ. Math. (New Series), vol.3, pp.31-65, 1956. ,
Decomposing Polynomial Systems into Simple Systems, Journal of Symbolic Computation, vol.25, issue.3, pp.295-314, 1998. ,
DOI : 10.1006/jsco.1997.0177
URL : http://doi.org/10.1006/jsco.1997.0177