34 search results - page 6 / 7 » issac 2009 |
ISSAC
2009
Springer
14 years 23 days ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
ISSAC
2009
Springer
14 years 23 days ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
ISSAC
2009
Springer
14 years 23 days ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
ISSAC
2011
Springer
12 years 9 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
ISSAC
2009
Springer
14 years 23 days ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...