Reductions and Completeness

Reductions. . When is problem A at least as hard as problem B? if B reduces to A: there is a transformation R which takes input x of B and creates input R(x) for A such that A(R(x)) = B(x) i.e. let A solve R(x) and that gives the result for B on x makes sense only if R is ?easy" to compute less

faolan + Follow