ISSAC
2004
Springer
15 years 4 months ago
2004
Springer
We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in...
58
Voted
ISSAC
2004
Springer
15 years 4 months ago
2004
Springer
ISSAC
2004
Springer
15 years 4 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
104
click to vote
ISSAC
2004
Springer
15 years 4 months ago
2004
Springer
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...