Pages that link to "Item:Q1977143"
From MaRDI portal
The following pages link to Deformation techniques for efficient polynomial equation solving. (Q1977143):
Displaying 31 items.
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- A linear algebra approach to the differentiation index of generic DAE systems (Q733711) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Deformation of polar methods (Q1203384) (← links)
- Computing parametric geometric resolutions (Q1566400) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- The method of Gauss-Newton to compute power series solutions of polynomial homotopies (Q2002799) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II (Q2307966) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- On the complexity of the resolvent representation of some prime differential ideals (Q2496182) (← links)
- Puiseux Expansions and Nonisolated Points in Algebraic Varieties (Q2813651) (← links)
- Modular equations for hyperelliptic curves (Q4821057) (← links)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)
- In memoriam. Succinct obituary in memoriam of Joos Heintz (Q6665427) (← links)
