Is it NP-Complete to determine if a quadratic program (QP) has multiple solutions? If this is known, can someone point me to a proof?

Edit:

A QP is essentially a LP with a quadratic objective. That is, it looks like:

minimize $\frac{1}{2} x^T Q x + c^T x$

s.t. $Ax \leq b$

It's known that in general, solving a QP is NP-Hard. Is it NP-Complete to know if there are at least two different solutions to the QP?
[Since I could not edit my comment, I repost it here as an answer] 

To determine if a quadratic program (QP) has multiple solutions (so you have to answer "Yes" if the QP has more than one solutions, and "No" if it has one or no solution) can be shown to be NP-complete by modifying the proof on NP-completeness of QP here http://link.springer.com/article/10.1007%2FBF00120662. 

The proof uses a reduction from k-clique to a QP. Now, add a free variable to the QP, so that it has one solution iff it have multiple ones. Thus, the answer to the problem if QP has multiple solutions or not gives the answer to the question if a graph has a clique of size k or not.