Pages that link to "Item:Q1025391"
From MaRDI portal
The following pages link to On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391):
Displaying 31 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- A new method to compute the singularities of offsets to rational plane curves (Q492111) (← links)
- Bivariate triangular decompositions in the presence of asymptotes (Q512372) (← links)
- The nearest complex polynomial with a zero in a given complex domain (Q650944) (← links)
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (Q651875) (← links)
- A note on the complexity of real algebraic hypersurfaces (Q659701) (← links)
- A worst-case bound for topology computation of algebraic curves (Q765857) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Certified numerical real root isolation for bivariate nonlinear systems (Q2156364) (← links)
- Computing the topology of a plane or space hyperelliptic curve (Q2174086) (← links)
- On the topology and isotopic meshing of plane algebraic curves (Q2179658) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← links)
- Multiplicity-preserving triangular set decomposition of two polynomials (Q2341596) (← links)
- Certified rational parametric approximation of real algebraic space curves with local generic position method (Q2437282) (← 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)
- Numerical solution of bivariate and polyanalytic polynomial systems (Q2927822) (← links)
- On the Bit Complexity of Solving Bilinear Polynomial Systems (Q2985830) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- Exact line and plane search for tensor optimization (Q5963312) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← 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)