ON THE DIFFICULTY OF DECIDING THE CONVEXITY OF POLYNOMIALS OVER SIMPLEXES

DOI10.1142/S0218195996000150zbMath0854.68106OpenAlexW2149179701MaRDI QIDQ4889508

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)

Related Items (2)

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