Can NP hard problems be solved?
Photo Credit: Courtesy of 3DStockPhoto (problems image)
Although it is suspected that there are no polynomial-time algorithms for NP-hard problems, this has not been proven. Moreover, the class P, in which all problems can be solved in polynomial time, is contained in the NP class.