Information for my students:
I will open notebooks (test notebook):
13.8 Monday 18:30
20.8 Monday 18:30
This Year Courses:
Computability
Advance Algorithm(Nituch Algorithm)
Complexity Theory ("Murcavut Chsuvit"):
For home work read in the Space Complexity lecture p.20-p.23
Prove the Time Hierarchy (that for all two easy computable functions f,g that f>g*loglogn there exist a language that can be computable in time f but not in g)
Material
IP
#P
ZK
Space complexity
Non-Deterministic Space
The structure of NL
Randomized Computation
Space Complexity (PPT)
IP (PPT)
ZK (PPT)
Questions
>
Advance Algorithm ("Nituch Algorithm"):
Read the material on online until the random algorithms
Material
Online Algorithm
Approximation Algorithms
Online Algorithms
Exercises:
Exercise For "Pesach"
Automata:
It seem to be a Multi Choice Question
test, Koppel and Lewenstein will write it together.
Exercises:
Exercise 1
Exercise 2
Exercise 3
Exercise 4 and 5
Exercise 6
Exercise 7
Exercise 8
Exercise 9
Exercise 10
Exercise 11
Data
Structure
Becuase The "SVITA" we will have
to start with a big exercise
(We have one week and after it
"PESECH").
Exercises:
Exercise
1
Exercise
1t
Help Pages:
Help
1
Help
2
Help
3
Help
4
