Quadratic Programming is in NP
Vavasis, Stephen A.
Quadratic programming is an important example of optimization with applications to engineering design, coombinatorical optimization, game theory, and economics. Garey and Johnson  state that quadratic programming is NP-hard. In this report we show that it lies in NP, thereby proving that it is NP-complete.
computer science; technical report
Previously Published As