ON THE DIFFICULTY OF DECIDING THE CONVEXITY OF POLYNOMIALS OVER SIMPLEXES
1996 ◽
Vol 06
(02)
◽
pp. 227-229
◽
We analyze the complexity of deciding the convexity of polynomials over simplexes. For polynomials of degree four or higher, the decision problem requires accomplishing an NP-hard task; when the degrees of the polynomials are less than four, the problem can be solved in NC time.
2014 ◽
Vol 58
(1)
◽
pp. 27-32
2013 ◽
Vol 05
(01)
◽
pp. 1350001
◽
2001 ◽
Vol 11
(02)
◽
pp. 181-195
◽
1951 ◽
Vol 49
(22)
◽
pp. 203-221
◽