Improved bounds on absolute positiveness of multivariate polynomials
From MaRDI portal
(Redirected from Publication:2188981)
Recommendations
Cites work
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- A Lower Bound for Computing Lagrange’s Real Root Bound
- A Lower Bound on the Complexity of Orthogonal Range Queries
- A New Bound for the Zeros of Polynomials
- A new polynomial bound and its efficiency
- Bounds for absolute positiveness of multivariate polynomials
- Bounds for positive roots of polynomials
- Bounds on absolute positiveness of multivariate polynomials
- Computational geometry. Algorithms and applications.
- Faster algorithms for computing Hong's bound on absolute positiveness
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Improved bounds on absolute positiveness of multivariate polynomials
- Improvements of Lagrange's bound for polynomial roots
- Introduction to algorithms.
- Krandick's proof of Lagrange's real root bound claim
- Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
- Testing positiveness of polynomials
Cited in
(3)
This page was built for publication: Improved bounds on absolute positiveness of multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188981)