Regarding part (a):

1) if x is some pair <G,k>, then what is |x| ? the number of vertices+k ? the length of the binary/unary representation of G ?

2) should we prove that M works at exactly 2^(c|x|^d) steps, or should it be O(2^(…)) ?

- Instructors
- Prof. Nachum Dershowitz

Prof. Yishay Mansour - Assistants
- Ori Lahav

Mariano Schain

- Exam: Jul. 3
^{rd} - Moed B: Sep. 6
^{th}

**Exam moed B**

(11 Sep 2011 17:01)

**Exam**

(21 Jul 2011 07:22)

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License