The intrinsic complexity of parametric elimination methods
From MaRDI portal
Publication:4233451
zbMath0915.68073arXivalg-geom/9707006MaRDI QIDQ4233451
Joos Heintz, Guillermo Matera, Luis Miguel Pardo, Rosita Wachenchauzer
Publication date: 18 March 1999
Full work available at URL: https://arxiv.org/abs/alg-geom/9707006
Related Items
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Deformation techniques to solve generalised Pham systems, A concise proof of the Kronecker polynomial system solver from scratch, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Fast computation of a rational point of a variety over a finite field, Systems of rational polynomial equations have polynomial size approximate zeros on the average
