Pages that link to "Item:Q757065"
From MaRDI portal
The following pages link to Complexity of computation on real algebraic numbers (Q757065):
Displaying 28 items.
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets (Q581617) (← links)
- Linear solving for sign determination (Q638542) (← links)
- Stability versus speed in a computable algebraic model (Q817853) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- On Newton's rule and Sylvester's theorems (Q923140) (← links)
- Cauchy index computation (Q1127957) (← links)
- Determinantal formulae for the solution set of zero-dimensional ideals (Q1181435) (← links)
- NC algorithms for real algebraic numbers (Q1201334) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Computing in the field of complex algebraic numbers (Q1382036) (← links)
- Does computer algebra help at all learning about real numbers? (Q1404700) (← links)
- Generic computation of the real closure of an ordered field. (Q1565819) (← links)
- Dynamic evaluation and real closure. (Q1565836) (← links)
- A new graph characteristic and its application to numerical computability (Q1603419) (← links)
- Polynomial-time presentations of algebraic number fields (Q1670714) (← links)
- On the complexity of algebraic numbers (Q1876890) (← links)
- Towards faster real algebraic numbers (Q1878487) (← links)
- Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- On the complexity of conversion between classic real number representations (Q2106593) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- A theorem on random polynomials and some consequences in average complexity (Q2277521) (← links)
- Zero-nonzero and real-nonreal sign determination (Q2435509) (← links)
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers (Q3033848) (← links)
- Sensing as a Complexity Measure (Q5205034) (← links)
- Algorithms – ESA 2004 (Q5464622) (← links)
- Topics in real and complex number complexity theory (Q5501602) (← links)
