| http://www.w3.org/ns/prov#value | - Amazingly, it would also hand Santa a polynomial time algorithm for all other problems in the NP class ??? because it turns out that his problem is a version of the famous travelling salesman problem, and that all the other problems in the NP class can be reduced to it.
|
