Quadratic programming is an important example of optimization with applications to engineering design, coombinatorical optimization, game theory, and economics. Garey and Johnson [1979] state that quadratic programming is NP-hard. In this report we show that it lies in NP, thereby proving that it is NP-complete.