Consider a reduction of an NP-complete problem to a polynomial-time problem. What will be the consequence, if any, if • the reduction takes polynomial time? • the reduction takes exponential time?
Reduction of an NP-complete problem to a polynomial-time problem
3
$\begingroup$
algorithms
-
131) P=NP 2) none. – 2012-12-05
-
4Comment of the year dude. – 2012-12-05
-
0Can you please explain it. Thanks – 2012-12-05
-
0@KarolisJuodelė, you are the man. – 2012-12-13