The intrinsic complexity of parametric elimination methods
From MaRDI portal
Publication:4233451
Abstract: This paper is devoted to the complexity analysis of a particular property, called "algebraic robustness" owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which owns this property must neccessarily have an exponential sequential time complexity.
Recommendations
Cited in
(11)- Deformation techniques to solve generalised Pham systems
- Software engineering and complexity in effective algebraic geometry
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals
- On the intrinsic complexity of elimination theory
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Kronecker's smart, little black boxes
- A concise proof of the Kronecker polynomial system solver from scratch
- On the time-space complexity of geometric elimination procedures
- Fast computation of a rational point of a variety over a finite field
- The hardness of polynomial equation solving
This page was built for publication: The intrinsic complexity of parametric elimination methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4233451)
