Computational Complexity Theory

 

Exercises

In order to take the course's exam, one must submit all but one of the home-assignments!

The written exercises should be submitted to the checker’s mail box:

Alon Brook, mailbox 394.

The exercises will be returned to the course’s mailbox at Schreiber, room 114.

If you have questions regarding the checking, you may contact Alon at: alnbrk@post.tau.ac.il

In case of late submission due to army service (“Miluim”) please attach a copy of the certificate to the exercise.


 

Exe #

PS file

PDF file

Sol  PS file

Sol PDF file

Due

Remarks

1

ex01.ps

ex01.pdf

sol01.ps

sol01.pdf

13/11/03

In question 3 – Lpal is the language of

palindromes we saw in class.

1b

Ex1 on exercise site

27/11/03

- Interactive questions regarding TM

- This exercise is NOT mandatory.

-Use your university user & password to enter the site.

2

ex02.ps

ex02.pdf

sol02.ps

sol02.pdf

27/11/03

- All the reductions in the exercise are

polynomial time Karp reductions.

- Question 3 – SGI – the graphs are

undirected.

3

Ex3 on exercise site

5/12/03

 

4

ex04.ps

ex04.pdf

sol04.ps

sol04.pdf

25/12/03

...

5

ex05.ps

ex05.pdf

sol05.ps

sol05.pdf

1/1/04

 

6

Ex6 on exercise site

11/1/04

 

7

ex07.ps

ex07.pdf

sol07.ps

sol07.pdf

19/1/04

 

8

ex08.ps

ex08.pdf

sol08.ps

sol08.pdf

26/1/04

Q4 Canceled