Pages that link to "Item:Q1566400"
From MaRDI portal
The following pages link to Computing parametric geometric resolutions (Q1566400):
Displaying 39 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- A geometric index reduction method for implicit systems of differential algebraic equations (Q719759) (← links)
- Finding new families of rank-one convex polynomials (Q732513) (← links)
- A linear algebra approach to the differentiation index of generic DAE systems (Q733711) (← links)
- Blind algebraic identification of communication channels: symbolic solution algorithms (Q857886) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Dynamic balancing of planar mechanisms using toric geometry (Q1030265) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- On solving parametric polynomial systems (Q1949089) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- An improvement of the rational representation for high-dimensional systems (Q2121180) (← links)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← 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)
- Solving parametric polynomial systems (Q2455750) (← 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)
- A probabilistic algorithm for computing data-discriminants of likelihood equations (Q2628325) (← links)
- On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
- A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications (Q2829998) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping (Q3597979) (← links)
- On computing absolutely irreducible components of algebraic varieties with parameters (Q5962004) (← links)