Ahmadi, A. A., Olshevsky, A., Parrilo, P. A., & Tsitsiklis, J. N. (2013). NP-hardness of deciding convexity of quartic polynomials and related problems. Mathematical programming, 137(1-2), 453-476. https://doi.org/10.1007/s10107-011-0499-2
Chicago-Zitierstil (17. Ausg.)Ahmadi, Amir Ali, Alex Olshevsky, Pablo A. Parrilo, und John N. Tsitsiklis. "NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems." Mathematical Programming 137, no. 1-2 (2013): 453-476. https://doi.org/10.1007/s10107-011-0499-2.
MLA-Zitierstil (9. Ausg.)Ahmadi, Amir Ali, et al. "NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems." Mathematical Programming, vol. 137, no. 1-2, 2013, pp. 453-476, https://doi.org/10.1007/s10107-011-0499-2.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.