A poly algorithm for computing resultants
It is well known that resultant computations are very important in computer algebra systems because of their contribution as essential tools to many applications. The resultant of two polynomials is a form in the coefficients of the same polynomials whose vanishing is a necessary and sufficient cond...
| Auteur principal: | |
|---|---|
| Format: | Thèse |
| Langue: | English |
| Publié: |
2003.
|
| Sujets: |