Pages that link to "Item:Q765857"
From MaRDI portal
The following pages link to A worst-case bound for topology computation of algebraic curves (Q765857):
Displaying 18 items.
- Improved bounds for the CF algorithm (Q385006) (← 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)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Improving the topology computation of an arrangement of cubics (Q945944) (← links)
- A polynomial-time algorithm for the topological type of real algebraic curve - extended abstract (Q1070298) (← links)
- A polynomial-time algorithm for the topological type of real algebraic curve (Q1115496) (← links)
- Computing the topology of a bounded non algebraic curve in the plane (Q1209616) (← links)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Detecting similarity of rational plane curves (Q2252245) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← links)
- On the Davenport-Mahler bound (Q2360668) (← links)
- An improved upper complexity bound for the topology computation of a real algebraic plane curve (Q2365422) (← links)
- Certified rational parametric approximation of real algebraic space curves with local generic position method (Q2437282) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- On the complexity of computing the topology of real algebraic space curves (Q2661918) (← links)
