| http://www.w3.org/ns/prov#value | - ???In {{w|Computational complexity theory|computational complexity theory}}, NP stands for ???nondeterministic polynomial time,??? which means that problems which are NP take polynomial running time (i.e. the time a CPU would take to run the program would be polynomial in the input size) to verify a solution, but it is unknown whether finding any or all solutions can be done in polynomial time.
|
