Pages that link to "Item:Q1133877"
From MaRDI portal
The following pages link to On the complexity of algorithms for the translation of polynomials (Q1133877):
Displaying 8 items.
- The fastest exact algorithms for the isolation of the real roots of a polynomial equation (Q1137352) (← links)
- An implementation of Vincent's theorem (Q1142536) (← links)
- Vincent's forgotten theorem, its extension and application (Q1162110) (← links)
- On the cost of evaluating polynomials and their derivatives (Q1164995) (← links)
- Exact algorithms for polynomial real root approximation using continued fractions (Q1171358) (← links)
- On the solution of polynomial equations using continued fractions (Q1258594) (← links)
- Computationally efficient algorithms for a one-time pad scheme (Q3038660) (← links)
- Polynomial real root approximation using continued fractions (Q3666149) (← links)