644 search results - page 7 / 129 » Real Algebraic Numbers: Complexity Analysis and Experimentat... |
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
ISSAC
1989
Springer
13 years 11 months ago
1989
Springer
The use of lookup tables can reduce the complexity of calculation of functions defined typically by mathematical recurrence relations. Although this technique has been adopted by...
JC
2006
13 years 7 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...