>>12030288Retard logic. Some cannot cope with the fact that this basic question has been open for years, and likely will be for some time.
While it is reasonable to conclude that after showing a problem is NP-hard, you are probably not going to find a polynomial time algorithm, P != NP does not follow from that.
