The following pages link to (Q4714011):
Displaying 29 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Bit-size estimates for triangular sets in positive dimension (Q657656) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- Probabilistic algorithms for computing resolvent representations of regular differential ideals (Q985372) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Evaluation techniques for zero-dimensional primary decomposition (Q1030246) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- A modular method to compute the rational univariate representation of zero-dimensional ideals (Q1808670) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← 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)
- Improved explicit estimates on the number of solutions of equations over a finite field (Q2490135) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Segre-driven radicality testing (Q6184180) (← links)
