Additive Complexity and Zeros of Real Polynomials
From MaRDI portal
Software, source code, etc. for problems pertaining to field theory (12-04) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials over commutative rings (13B25) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- scientific article; zbMATH DE number 2086908
- Test complexity of generic polynomials
- Constraints on the angular distribution of the zeros of a polynomial of low complexity
- Algebraic complexity of computing polynomial zeros
- On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials
Cited in
(15)- Algebraic complexity of computing polynomial zeros
- On polynomials with symmetric Galois group which are easy to compute
- Constraints on the angular distribution of the zeros of a polynomial of low complexity
- Test complexity of generic polynomials
- Verification complexity of linear prime ideals
- Computability of the additive complexity of algebraic circuits with root extracting
- On Voronoi diagrams in the \(L_p\)-metric in \(\mathbb{R}^D\).
- On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem
- Intersection multiplicity of a sparse curve and a low-degree curve
- scientific article; zbMATH DE number 2086908 (Why is no real title available?)
- Topologie des hypersurfaces pfaffiennes
- Notes on the decidability of addition and the Frobenius map for polynomials and rational functions
- Some aspects of complexity in real algebraic geometry
- Testing polynomials
- Bezout theorem for Nash functions
This page was built for publication: Additive Complexity and Zeros of Real Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187376)
