Pages that link to "Item:Q757065"
From MaRDI portal
The following pages link to Complexity of computation on real algebraic numbers (Q757065):
Displaying 13 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)
- On Newton's rule and Sylvester's theorems (Q923140) (← links)
- Determinantal formulae for the solution set of zero-dimensional ideals (Q1181435) (← links)
- NC algorithms for real algebraic numbers (Q1201334) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Generic computation of the real closure of an ordered field. (Q1565819) (← links)
- Dynamic evaluation and real closure. (Q1565836) (← links)
- Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← 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)
- Sensing as a Complexity Measure (Q5205034) (← links)
