deterministic

  1. @

    Polynomial time reductions and NP completeness

    I unable to understand polynomial reduction. Here is the definition : "A problem L1 reduces to L2 if and only if there is a way to solve L1 by deterministic polynomial time algorithm using a deterministic algorithms that solves L2 in polynomial time" Is this is correct ? If yes, I would...
Top Bottom