All Questions
1 question
6
votes
1
answer
166
views
Is there such a notion as "effectively computable reductions" or would this be not useful
Most reductions for NP-hardness proofs I encountered are effective in the sense that given an instance of our hard problem, they give a polynomial time algorithm for our problem under question by ...
- 1,469