The following pages link to When Newton meets Descartes (Q5244548):
Displaying 19 items.
- A note on Legendre-Fenchel conjugate of the product of two positive-definite quadratic forms (Q384183) (← links)
- 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)
- Computing real roots of real polynomials (Q491245) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- On the topology and isotopic meshing of plane algebraic curves (Q2179658) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Theorem of three circles in Coq (Q2351412) (← links)
- On soft predicates in subdivision motion planning (Q2354924) (← 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)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- On the complexity of computing the topology of real algebraic space curves (Q2661918) (← links)
