Pages that link to "Item:Q607163"
From MaRDI portal
The following pages link to A deterministic algorithm for isolating real roots of a real polynomial (Q607163):
Displaying 20 items.
- Improved bounds for the CF algorithm (Q385006) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- Efficient isolation of polynomial's real roots. (Q1421215) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- An algorithm for locating all zeros of a real polynomial (Q1893153) (← links)
- On the determination of the number of positive and negative polynomial zeros and their isolation (Q2053518) (← links)
- Sampling polynomial trajectories for LTL verification (Q2055964) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- Logcf: an efficient tool for real root isolation (Q2287381) (← links)
- On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors (Q2365425) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- A new method for real root isolation of univariate polynomials (Q2468357) (← links)
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces (Q2674002) (← links)
- Counting and Testing Dominant Polynomials (Q2813821) (← links)
- Isolating real roots of real polynomials (Q2883823) (← links)
- (Q4226967) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- Efficient Predicate Evaluation Using Randomized Degeneracy Detection (Q5057658) (← links)
- Certified Numerical Real Root Isolation for Bivariate Polynomial Systems (Q5120479) (← links)
- When Newton meets Descartes (Q5244548) (← links)
