Add to ORKGthis paper a general transformation of polynomials, and show that the classical deep relationships between the problems : (T ) transforming equations by a morphism (R) elementary elimination theory by resultants (S) change of bases for symmetric polynomials. can be illustrated in Computer Algebra. Actually they are algorithmically equivalent because every one is a particular case of another one, as shown by the following diagram
AbstractThe last decade has witnessed the rebirth of resultant methods as a powerful computational t...
This thesis investigates the reducibility of trivariate homogeneous symmetric polynomials. For polyn...
We define the class of elimination algorithms. These are algebraic algorithms for evaluating multiva...
Contribution à un ouvrage.This article gives an informal account of the theory, algorithms, software...
This article presents several different methods for solving the problem of how to find a certain rel...
Livre en chinois. Ouvrage (auteur).This book provides a systematic and uniform presentation of elimi...
AbstractWe consider certain generalisation of the resultant of two polynomials in one variable. Usin...
This work is about theory of systems of polynomial equations. Its main purpose is to prove the Elimi...
We consider several simple combinatorial problems and discuss different ways to express them using p...
We are after a generator of the elimination ideal of an ideal generated bu two polynomials in two va...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
AbstractThe aim of this paper is to introduce two new elimination procedures for algebraic systems o...
AbstractThis paper deals with some ideas of Bézout and his successors Poisson, Netto and Laurent for...
International audienceWe study the decomposition of multivariate polynomials as sums of powers of li...
We present a simple algorithm for decomposing a polynomial H(x) into two constituent polynomials H(x...
AbstractThe last decade has witnessed the rebirth of resultant methods as a powerful computational t...
This thesis investigates the reducibility of trivariate homogeneous symmetric polynomials. For polyn...
We define the class of elimination algorithms. These are algebraic algorithms for evaluating multiva...
Contribution à un ouvrage.This article gives an informal account of the theory, algorithms, software...
This article presents several different methods for solving the problem of how to find a certain rel...
Livre en chinois. Ouvrage (auteur).This book provides a systematic and uniform presentation of elimi...
AbstractWe consider certain generalisation of the resultant of two polynomials in one variable. Usin...
This work is about theory of systems of polynomial equations. Its main purpose is to prove the Elimi...
We consider several simple combinatorial problems and discuss different ways to express them using p...
We are after a generator of the elimination ideal of an ideal generated bu two polynomials in two va...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
AbstractThe aim of this paper is to introduce two new elimination procedures for algebraic systems o...
AbstractThis paper deals with some ideas of Bézout and his successors Poisson, Netto and Laurent for...
International audienceWe study the decomposition of multivariate polynomials as sums of powers of li...
We present a simple algorithm for decomposing a polynomial H(x) into two constituent polynomials H(x...
AbstractThe last decade has witnessed the rebirth of resultant methods as a powerful computational t...
This thesis investigates the reducibility of trivariate homogeneous symmetric polynomials. For polyn...
We define the class of elimination algorithms. These are algebraic algorithms for evaluating multiva...