NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-hardness of deciding convexity of quartic polynomials and related problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of deciding convexity of quartic polynomials and related problems |
scientific article |
Statements
NP-hardness of deciding convexity of quartic polynomials and related problems (English)
0 references
18 March 2013
0 references
NP-hardness of deciding convexity
0 references
polynomial time algorithms
0 references
computational complexity
0 references
global convexity
0 references
strict convexity
0 references
strong convexity
0 references
quasiconvexity
0 references
pseudoconvexity
0 references
even degree polynomials
0 references
odd degree polynomials
0 references
0 references
