Pages that link to "Item:Q325154"

The following pages link to Solving bivariate systems using rational univariate representations (Q325154):

Displaying 18 items.

• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
• Bivariate triangular decompositions in the presence of asymptotes (Q512372) (← links)
• On the bit complexity of polynomial system solving (Q1734694) (← links)
• Fast computation of generic bivariate resultants (Q1996880) (← links)
• Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves (Q2029428) (← links)
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
• Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
• Certified numerical real root isolation for bivariate nonlinear systems (Q2156364) (← links)
• Computing the topology of a plane or space hyperelliptic curve (Q2174086) (← links)
• The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
• An algebraic framework for computing the topology of offsets to rational curves (Q2357689) (← links)
• On the complexity of computing the topology of real algebraic space curves (Q2661918) (← links)
• \texttt{PTOPO}: computing the geometry and the topology of parametric curves (Q2674019) (← links)
• A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays (Q3297392) (← links)
• Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
• An improved complexity bound for computing the topology of a real algebraic space curve (Q6543074) (← links)
• An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases (Q6650574) (← links)
• Computing the non-properness set of real polynomial maps in the plane (Q6672004) (← links)