174 search results - page 2 / 35 » Comparing Real Algebraic Numbers of Small Degree |
ESA
2006
Springer
13 years 9 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
TCS
2008
13 years 5 months ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
AISC
1998
Springer
13 years 10 months ago
1998
Springer
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
DIMACS
2001
13 years 7 months ago
2001
Let C be a smooth real plane curve. Let c be its degree and g its genus. We assume that C has at least g real branches. Let d be a nonzero natural integer strictly less than c. Let...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...