Pages that link to "Item:Q2985810"
From MaRDI portal
The following pages link to Complexity Analysis of Root Clustering for a Complex Polynomial (Q2985810):
Displaying 10 items.
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
- Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
- �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise (Q4997829) (← links)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
- On μ-symmetric polynomials (Q5046095) (← links)
- A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs (Q6075716) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)
- Complexity of a root clustering algorithm for holomorphic functions (Q6496875) (← links)
