| http://www.w3.org/ns/prov#value | - In this sense, the problem H is NP-hard if and only if every decision problem L in NP can be solved in polynomial time by an oracle machine with an oracle for H. (Informally we can think of such a machine as an algorithm that can call a subroutine for solving H and solves L in polynomial time if the subroutine call takes only one step to compute.) If we find a polynomial-time algorithm for an NP-h
|
