Pages that link to "Item:Q1565838"
From MaRDI portal
The following pages link to Radical computations of zero-dimensional ideals and real root counting. (Q1565838):
Displayed 12 items.
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals (Q492020) (← links)
- On the computation of matrices of traces and radicals of ideals (Q654040) (← links)
- A generalization of Stickelberger's theorem (Q924361) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- Computer algebra and algebraic geometry -- achievements and perspectives (Q1587227) (← links)
- Simultaneous elimination by using several tools from real algebraic geometry (Q1808663) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Interpolation of ideals (Q2340468) (← links)
- Parallelization of modular algorithms (Q2430024) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
- A moment approach to analyze zeros of triangular polynomial sets (Q5714388) (← links)