Can every problem $ A \in P $ be reduced to any other problem $ B \in P $? If so, does that mean all problems in $ P $ have the same level of difficulty? Does this also hold for other complexity classes, for example $NP$ without $NP-complete$?
Can every problem $ A \in P $ be reduced to any other problem $ B \in P $? If so, does that mean all problems in $ P $ have the same level of difficulty? Does this also hold for other complexity classes, for example $NP$ without $NP-complete$?
