Group: uw.cs.cs341 · Group Profile · Search for Reduct in uw.cs.cs341
Author: Nick Bowler
Date: Apr 19, 2008 12:31
...to a problem in X). A simple counter example to the "must show reduction both ways" claim: - We know all problems in NP are decidable (by ...A and B are both NP-complete, then it is true that the reduction works both ways (both problems are in NP and NP-hard, and ... of them). However, we don't need to explicitly show that the reduction works both ways; we simply need to show that: A is NP-...
|