Pages that link to "Item:Q5145969"
From MaRDI portal
The following pages link to On the bit complexity of finding points in connected components of a smooth real hypersurface (Q5145969):
Displayed 3 items.
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Faster real root decision algorithm for symmetric polynomials (Q6081968) (← links)
