The following pages link to The DMM bound (Q2946545):
Displaying 19 items.
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Computing the topology of a plane or space hyperelliptic curve (Q2174086) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- On the minimum of a positive polynomial over the standard simplex (Q2269694) (← links)
- Computing real witness points of positive dimensional polynomial systems (Q2357373) (← links)
- On the Davenport-Mahler bound (Q2360668) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- Improving root separation bounds (Q2399862) (← links)
- A certified iterative method for isolated singular roots (Q2674007) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- Symbolic Methods for Solving Algebraic Systems of Equations and Applications for Testing the Structural Stability (Q5118408) (← links)
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
- Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles (Q5857573) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)