On the difficulty of deciding the convexity of polynomials over simplexes

International Journal of Computational Geometry and Applications

Volumn 6, Issue 2, 1996, Pages 227-229

  Guo, Baining ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

And simplexes; Convexity; Polynomials

Indexed keywords

EID: 2842612385     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000150     Document Type: Article

References (4)

1. L. Csanky, "Fast parallel inversion algorithms", SIAM J. Comp., 5:818-823, 1976.
2. M. Garey and D. Johnson, Computers and Intractability: A Guild to the Theory of NP-completeness, W. H. Freeman and Company, San Francisco, 1979.
3. T. Motzkin and E. Straus, "Maxima for graphs and a new proof of a theorem of Turan", Canadian Journal of Mathematics, 17:533-540, 1965.
4. S. Sahni, "Computationally related problems", SIAM J. Comp., 3:262-279, 1974.