1. 1 SIP 250, AB 42

2. 2

3. 3 We’ll use reductions that, by default, would be of this type, which is called: Polynomial-time mapping reduction Polynomial-time many-one reduction Polynomial-time Karp reduction !

4. 4

5. 5

6. 6

7. 7

8. 8

9. 9

10. 10 Do it yourself !!

11. 11 SIP 250, AB 88

13. 13

14. 14 An oracle Turing machine M has one extra “query tape” and three special states q query,q yes,q no. To execute M we specify a language O  {0,1} *, that is used as the “oracle”. When M O enters q query, it either moves to q yes or q no according to whether the string on the query tape belongs to O or not. An oracle call counts as one  step.

15. 15

16. 16 Let L be a language L * = { x | x=x 1..x k, x i  L }

17. 17

18. 18