Group: uw.cs.cs341 · Group Profile · Search for exams in uw.cs.cs341
Author: Carmen Bruni
Date: Aug 6, 2008 12:53
Was wondering if anyone else noticed this. I thought in class we defined polynomial time reductions from decision problem to decision problem. Clearly Q6 in both the sample exams, the questions asks for a Turing polytime reduction from a non decision problem to a decision problem - anyone know what they exactly mean here? (From what I think they could mean, the Subset Sum to SSP should be...
|