On the complexity of quadratic programming in real number models of computation

K. Meer
1994 Theoretical Computer Science  
Meer, K. On the complexity of quadratic programming in real number models of computation, Theoretical Computer Science 133 (1994) 85-94. 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
more » ... discussed. Complexity of quadratic programming 87 Series of Monoqruphs on Computrr Scirnce Vol. 8 (Oxford University Press, New York, 1991).
doi:10.1016/0304-3975(94)00070-0 fatcat:wx2tcrz475hutithkoz6abv24y