A more precise specification is: a problem "H" is NP-hard when every problem "L" in NP can be reduced in polynomial time to "H"; that is, assuming a solution for "H" takes 1 unit time, "H"'s solution can be used to solve "L" in polynomial time. As a consequence, finding a polynomial time algorithm to solve any NP-hard problem would give polynomial time algorithms for all the problems in NP. As it is suspected that P formula_1 NP, it is unlikely that such an algorithm exists.