I've recently begun studying reductions in my algorithms class. All the reductions I've seen have been from decision problem $\to$ decision problem.
Is it possible to do reductions with non-decision problems? Can NP-hardness be shown in that way?
Asked
Active
Viewed 30 times
1
-
Of course you can! You need another notion of reduction, of course. Any reduction defines its own notion of completeness. – Raphael May 02 '14 at 21:57
-
Another related question. – Raphael May 02 '14 at 21:57
-
how do you think people knew puzzle like candy crush, tetris and minesweeper were NP complete in the first place? (that's my cool way of telling you to look up these papers!) – Subhayan May 02 '14 at 23:23