The connection between NP and Decision Pro -
state t/f. if proves p = np, imply every decision problem can solved in polynomial time. think false. right?
if p = np, means decision problem in np can solved in polynomial time. is, decision problem "yes" answers verified efficiently solved in polynomial time.
this not same saying decision problems can solved in polynomial time. example, decision problems (such halting problem) undecidable, meaning can't decided @ all. proving p = np doesn't change that.
Comments
Post a Comment