TY - GEN A1 - Meer, Klaus T1 - On the complexity of Quadratic Programming in real number models of computation T2 - Theoretical Computer Science N2 - The complexity of linearly constrained (nonconvex) quadratic programming is analyzed within the framework of real number models, namely the one of Blum, Shub, and Smale and its modification recently introduced by Koiran (“weak BSS-model”). In particular we show that this problem is not NP-complete in the Koiran setting. Applications to the (full) BSS-model are discussed. Y1 - 2016 UR - https://opus4.kobv.de/opus4-UBICO/frontdoor/index/index/docId/15886 UR - http://www.sciencedirect.com/science/article/pii/0304397594000700 SN - 0304-3975 VL - 133 IS - 1 SP - 85 EP - 94 ER -