Pages that link to "Item:Q1293968"

The following pages link to Solving zero-dimensional systems through the rational univariate representation (Q1293968):

Displaying 50 items.

• Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
• New nonarithmetic complex hyperbolic lattices. II (Q1980008) (← links)
• Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
• Certified non-conservative tests for the structural stability of discrete multidimensional systems (Q2002386) (← links)
• Deterministic normal position transformation and its applications (Q2006776) (← links)
• Solving the equality-constrained minimization problem of polynomial functions (Q2010089) (← links)
• Computing real solutions of fuzzy polynomial systems (Q2035296) (← links)
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← 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)
• Degröbnerization: a political manifesto (Q2100110) (← links)
• Effective algorithm for computing Noetherian operators of zero-dimensional ideals (Q2100118) (← links)
• Quantitative curve selection lemma (Q2114147) (← 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)
• 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)
• 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)
• 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)
• 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)
• 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)
• Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
• Fast computation of special resultants (Q2457312) (← links)
• From an approximate to an exact absolute polynomial factorization (Q2457357) (← links)
• Improved explicit estimates on the number of solutions of equations over a finite field (Q2490135) (← 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)
• \texttt{PTOPO}: computing the geometry and the topology of parametric curves (Q2674019) (← links)
• Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro (Q2743867) (← links)
• Real Root Isolation of Regular Chains (Q2799549) (← links)
• Real Root Isolation of Polynomial Equations Based on Hybrid Computation (Q2799571) (← links)
• The Approach of Moments for Polynomial Equations (Q2802518) (← links)
• Exact algorithms for linear matrix inequalities (Q2834563) (← links)