The following pages link to ISOLATE (Q19758):
Displaying 50 items.
- Degröbnerization: a political manifesto (Q2100110) (← links)
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals (Q2100118) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Computing PUR of zero-dimensional ideals of breadth at most one (Q2121179) (← links)
- An improvement of the rational representation for high-dimensional systems (Q2121180) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- On the topology and isotopic meshing of plane algebraic curves (Q2179658) (← links)
- Numerical roadmap of smooth bounded real algebraic surface (Q2180637) (← links)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
- How to count the number of zeros that a polynomial has on the unit circle? (Q2222071) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Algebraic analysis of stability and bifurcation of a self-assembling micelle system (Q2249013) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- On the minimum of a positive polynomial over the standard simplex (Q2269694) (← links)
- Complexity in iteration of polynomials (Q2273627) (← links)
- From fixation probabilities to \(d\)-player games: an inverse problem in evolutionary dynamics (Q2283911) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection (Q2284963) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
- Logcf: an efficient tool for real root isolation (Q2287381) (← links)
- A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
- Computing and using minimal polynomials (Q2307625) (← links)
- Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram (Q2321881) (← links)
- Real algebraic numbers and polynomial systems of small degree (Q2378492) (← links)
- Stable normal forms for polynomial system solving (Q2378497) (← links)
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis (Q2392952) (← links)
- Guaranteed collision detection with toleranced motions (Q2396310) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Determination of the limits for multivariate rational functions (Q2445506) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
- Vincent's theorem of 1836: overview and future research (Q2452926) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- New bounds for the Descartes method (Q2457314) (← links)
- From an approximate to an exact absolute polynomial factorization (Q2457357) (← links)
- On the geometry of parametrized bicubic surfaces (Q2457413) (← links)
- Testing sign conditions on a multivariate polynomial and applications (Q2465578) (← links)
- Using computer algebra to certify the global convergence of a numerical optimization process (Q2468356) (← links)
- A new method for real root isolation of univariate polynomials (Q2468357) (← links)
- Approximate radical for clusters: A global approach using Gaussian elimination or SVD (Q2468363) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Improved explicit estimates on the number of solutions of equations over a finite field (Q2490135) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Intersecting quadrics: an efficient and exact implementation (Q2507161) (← links)
- Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity (Q2516428) (← links)
- Rational univariate reduction via toric resultants (Q2517810) (← links)
- Motivations for an arbitrary precision interval arithmetic and the MPFI library (Q2572919) (← links)
