title: A very complex problem in reduction notion
body: <p>I have studied many about reduction but I have a bad problem in it:
  I take this from CLRS :</p>
  
  <p>" ... by “reducing” solving problem A to solving problem B, we use the “easiness” of B to prove the “easiness” of A."</p>
  
  <p>And I take this from "Computational Complexity by Christos H. Papadimitriou  " :</p>
  
  <p>" ... problem A is at least as hard as problem B if B reduces to A."</p>
  
  <p>I got confused with these two notion:
  when we use easiness , we say that problem X reduces to problem Y and if we have polynomial time algorithm for Y and reduction process is done in polynomial time then problem X is solvable in polynomial time and X is easier than Y or at least is not harder than Y.</p>
  
  <p>But when we use hardness , we say problem X reduces to problem Y and Y is easier than X or at least is not harder than X.</p>
  
  <p>I really got confused, Please help me.
  Special thanks.</p>