Pages that link to "Item:Q3452416"
From MaRDI portal
The following pages link to A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416):
Displaying 6 items.
- Computing real roots of real polynomials (Q491245) (← 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)
