Pages that link to "Item:Q2256707"
From MaRDI portal
The following pages link to Complexity of solving parametric polynomial systems (Q2256707):
Displaying 16 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
- Computing parametric geometric resolutions (Q1566400) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I (Q1661547) (← links)
- On solving parametric polynomial systems (Q1949089) (← links)
- On factoring parametric multivariate polynomials (Q1958945) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III (Q2202706) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II (Q2307966) (← links)
- Solving parametric polynomial systems (Q2455750) (← links)
- Computations with parameters: a theoretical background (Q2628948) (← links)
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations (Q2876420) (← links)
- MRHS Equation Systems that can be Solved in Polynomial Time (Q2970278) (← links)
- Complexity bound for the absolute factorization of parametric polynomials (Q5460915) (← links)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)
