Reduction from/to terminology
http://tau-cm2014.wikidot.com/forum/t-859605/reduction-from-to-terminology
Posts in the discussion thread "Reduction from/to terminology"Mon, 23 Sep 2019 12:17:33 +0000http://tau-cm2014.wikidot.com/forum/t-859605#post-2029209Re: Reduction from/to terminology
http://tau-cm2014.wikidot.com/forum/t-859605/reduction-from-to-terminology#post-2029209
Fri, 09 May 2014 22:05:20 +0000mansour91461
The reduction is from A to B when we write A <= B. It implies that if we have an algorithm for B, we can construct one for A. (Namely, we "reduce" solving A to solving B.)
]]>
http://tau-cm2014.wikidot.com/forum/t-859605#post-2029095Reduction from/to terminology
http://tau-cm2014.wikidot.com/forum/t-859605/reduction-from-to-terminology#post-2029095
Fri, 09 May 2014 17:42:07 +0000another
if A <= B, I assume A cannot be harder than B. Reduction is actually converting hard problem to an easier one. If so: Do we say that A <= B is a reduction from A to B, or that's a reduction from B to A. The second one makes more sense, but according to the pdf (Lecture 8, bottom of slide number 11) - you described A <= B as a reduction from A to B. I would like to know if it's not a mistake. And if it is not, it would be great to get explanation why we say that. Thanks.
]]>