Basic Information
Approximation Solutions of Np-hard Problems. Goldberg's Algorithm For Network Flow. Efficient Solutions of Certain Flow Problems. Randomized Algorithms. Matching in Graphs. Fast Fourier Transform and Its Applications. Dynamic Programming.
Faculty: Computer Science
|Undergraduate Studies
|Graduate Studies
Pre-required courses
(94412 - Probability (advanced) and 236343 - Theory of Computation) or (104034 - Introduction to Probability H and 236343 - Theory of Computation)
Semestrial Information
Weekly Hours
3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours
Go to Course Page
Responsible(s)
Joseph Naor
Exams
Session A: 18-07-2022 13:00 - 16:00- אולמן 708.
- טאוב 4.
Registration Groups
|
|
Weekly Hours
3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours
Go to Course Page
Responsible(s)
Joseph Naor
Exams
Session A: 25-07-2021 13:00 - 16:00- טאוב 8.
- טאוב 4.
Registration Groups
|
|
Weekly Hours
3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours
Go to Course Page
Responsible(s)
Joseph Naor
Exams
Session A: 10-07-2020 09:00 - 12:00- טאוב 8. 9.
- חדרי זום 133. 134.