ON THE DIFFICULTY OF DECIDING THE CONVEXITY OF POLYNOMIALS OVER SIMPLEXES

DOI10.1142/S0218195996000150MaRDI QIDQ4889508zbMATHOpenAlexFDO

Authors Baining Guo

Publication date 12 August 1996

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195996000150

zbMATH Keywords

convexity of polynomials over simplexes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 3945887
• Some observations concerning polynomial convexity
• Convexity and Bernstein polynomials on \(k\)-simploids
• scientific article; zbMATH DE number 28520
• Polynomial convexity of some sets in \(\mathbb{C}^ n\)
• On \(n\)-polynomial convexity and some related inequalities
• NP-hardness of deciding convexity of quartic polynomials and related problems
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• On the convex hull of solutions to polynomial congruences

Cited in

(3)

• On the complexity of detecting convexity over a box
• NP-hardness of deciding convexity of quartic polynomials and related problems
• A convex polynomial that is not sos-convex

This page was built for publication: ON THE DIFFICULTY OF DECIDING THE CONVEXITY OF POLYNOMIALS OVER SIMPLEXES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889508)