Pages that link to "Item:Q5187376"
From MaRDI portal
The following pages link to Additive Complexity and Zeros of Real Polynomials (Q5187376):
Displaying 15 items.
- Some aspects of complexity in real algebraic geometry (Q582342) (← links)
- Testing polynomials (Q755792) (← links)
- Bezout theorem for Nash functions (Q916744) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- On polynomials with symmetric Galois group which are easy to compute (Q1098889) (← links)
- Constraints on the angular distribution of the zeros of a polynomial of low complexity (Q1173756) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- Computability of the additive complexity of algebraic circuits with root extracting (Q1351701) (← links)
- On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\). (Q1923773) (← links)
- On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem (Q2256583) (← links)
- Intersection multiplicity of a sparse curve and a low-degree curve (Q2301455) (← links)
- (Q4737511) (← links)
- Topologie des hypersurfaces pfaffiennes (Q4883947) (← links)
- Notes on the decidability of addition and the Frobenius map for polynomials and rational functions (Q5057119) (← links)
