Pages that link to "Item:Q3452416"

The following pages link to A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416):

Displaying 9 items.

• 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)
• Root separation for trinomials (Q2000267) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
• SOME ANALYTICAL AND NUMERICAL RESULTS FOR THE ZEROS OF A CLASS OF FIBONACCI-LIKE POLYNOMIALS (Q5076167) (← links)
• Efficiently Computing Real Roots of Sparse Polynomials (Q5119944) (← links)
• A complexity chasm for solving univariate sparse polynomial equations over \(p\)-adic fields (Q6666555) (← links)