| http://www.w3.org/ns/prov#value | - But I think it is not, here is why:There is a conjecture that may have more chance than P = NP. And that is: P = NP intersect co-NP. That is if both acceptability and non-acceptibility can be polynomially verified then there would be a guaranteed polynomial algorithm.
|
