The following pages link to (Q4227291):
Displaying 18 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one (Q385011) (← links)
- Computing the multiplicity structure of an isolated singular solution: case of breadth one (Q413412) (← links)
- Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms (Q765856) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- Isolated points, duality and residues (Q1358925) (← links)
- Efficient computation of dual space and directional multiplicity of an isolated point (Q1634816) (← links)
- Subresultants in multiple roots (Q1938659) (← links)
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals (Q2100118) (← links)
- On deflation and multiplicity structure (Q2628321) (← links)
- (Q3349873) (← links)
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
- Computation of a specified root of a polynomial system of equations using eigenvectors (Q5926400) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros (Q6087590) (← links)
- Towards a Gröbner-free approach to coding (Q6146596) (← links)
- Squarefree normal representation of zeros of zero-dimensional polynomial systems (Q6184184) (← links)
