Pages that link to "Item:Q2200311"
From MaRDI portal
The following pages link to Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311):
Displaying 15 items.
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals (Q492020) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- Computation of generalized real radicals of polynomial ideals (Q1297627) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Generators for the \(C^m\)-closures of ideals (Q2031505) (← links)
- Computing real witness points of positive dimensional polynomial systems (Q2357373) (← links)
- Probabilistic algorithm for computing the dimension of real algebraic sets (Q2819735) (← links)
- Computing Real Roots of Real Polynomials ... and now For Real! (Q2985841) (← links)
- (Q3135197) (← links)
- Real Root Finding for Equivariant Semi-algebraic Systems (Q5120214) (← links)
- On the Complexity of Computing Real Radicals of Polynomial Systems (Q5120216) (← links)
- Computation of the <i>z</i>-radical in <i>C</i>(<i>X</i>) (Q5488631) (← links)
- Absolute concentration robustness: algebra and geometry (Q6650585) (← links)
- Computing real radicals by moment optimization (Q6666518) (← links)
- Computing the dimension of real algebraic sets (Q6666545) (← links)
