Is it possible to do reductions with non-decision problems?

Asked May 02 '14 at 20:58

Active May 02 '14 at 21:48

Viewed 30 times

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?

edited May 02 '14 at 21:48

Raphael

asked May 02 '14 at 20:58

jaynp

0 Answers0