I am given a task to prove using 3COLOR that Quadratic Programming is NP-hard. Does anyone have a clue on how this is meant to be done?

  • $\begingroup$ You're probably meant to try applying techniques you've seen in your course or textbook, and use this so you can practice those techniques -- not copy-paste the exercise into a website and wait for someone else to tell you how to solve it. What did you try? Where did you get stuck? We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in improving your question. $\endgroup$ – D.W. Dec 15 '17 at 19:03
  • $\begingroup$ You might be interested in our reference questions on reductions: cs.stackexchange.com/q/11209/755, cs.stackexchange.com/q/1240/755. $\endgroup$ – D.W. Dec 15 '17 at 19:04