Login / Signup
NP-hardness of deciding convexity of quartic polynomials and related problems.
Amir Ali Ahmadi
Alexander Olshevsky
Pablo A. Parrilo
John N. Tsitsiklis
Published in:
Math. Program. (2013)
Keyphrases
</>
related problems
np hardness
np hard
approximation algorithms
mixed integer
stable marriage
worst case analysis
broadly applicable
discrete tomography
convex hull
decision making
range searching
scheduling problem
computational complexity
special case
multi dimensional