Pages that link to "Item:Q4233451"
From MaRDI portal
The following pages link to The intrinsic complexity of parametric elimination methods (Q4233451):
Displaying 6 items.
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
