Pages that link to "Item:Q2191776"
From MaRDI portal
The following pages link to On the complexity of detecting convexity over a box (Q2191776):
Displaying 6 items.
- On cones of nonnegative quartic forms (Q525602) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- Linear interval parametric approach to testing pseudoconvexity (Q2022238) (← links)
- On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
- Convexity properties in binary detection problems (Q4885746) (← links)
- The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (Q5454268) (← links)