i just signed up here because im struggling very hard with a problem i gotta solve. What I wanna do is reducing an Instance of 3color to an instance of Quadprog to prove that quadprog is np-hard, and i have no idea how to do that. My first idea was to match every node to a varaible of quadprog, but i have no clue how to continue. Maybe anyone here knows how to help me?
Asked
Active
Viewed 21 times