Pages that link to "Item:Q1901472"
From MaRDI portal
The following pages link to On the distance between the roots of a polynomial (Q1901472):
Displayed 15 items.
- On the location of roots of non-reciprocal integer polynomials (Q429737) (← links)
- On the computing time of the continued fractions method (Q438690) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- Polynomial bounds for the solutions of a class of diophantine equations (Q1372593) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- On the distance between two algebraic numbers (Q2186276) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- Improving root separation bounds (Q2399862) (← links)
- Polynomial root separation examples (Q2457387) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Separation of the roots of polynomials and a question of Sprindzhuk (Q2574041) (← links)
- When should a polynomial’s root nearest to a real number be real itself? (Q2931187) (← links)
- Polaritons and excitons: Hamiltonian design for enhanced coherence (Q5161111) (← links)