*A first goal of this project is to optimize the MAPLE version of TRIADE
by calling Monagan's package where it applies.
The second goal is to modify Monagan's package in order
to compute the Bézout coefficients of the input polynomials.
That is, to implement an Extended Euclidean version of the algorithm
by M. Monagan and M. van Hoeij.
This will also help improving the MAPLE version of TRIADE
*

*A first goal of this project is to realize a MAPLE implementation
of this algorithm.
Then, the second goal is to optimize the MAPLE version of TRIADE
by calling the algorithm [MO04] where it applies.
*

2005-02-04