Pages that link to "Item:Q1137352"

The following pages link to The fastest exact algorithms for the isolation of the real roots of a polynomial equation (Q1137352):

Displaying 11 items.

• On the computing time of the continued fractions method (Q438690) (← links)
• A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
• A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
• On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006) (← links)
• Implementations of a new theorem for computing bounds for positive roots of polynomials (Q858189) (← links)
• A converse rule of signs for polynomials (Q1058001) (← links)
• Vincent's forgotten theorem, its extension and application (Q1162110) (← links)
• Exact algorithms for polynomial real root approximation using continued fractions (Q1171358) (← links)
• Vincent's theorem of 1836: overview and future research (Q2452926) (← links)
• Computationally efficient algorithms for a one-time pad scheme (Q3038660) (← links)
• Global minimization of univariate functions by sequential polynomial approximation (Q3831959) (← links)