|
|
|
||
This course covers advanced topics in computational complexity. Each semester will be devoted to a different topic. Topics will include among others: randomness and pseudorandom generators, communication complexity and interactive protocols, error-correcting codes and their applications in complexity, lower bounds, expanders and their applications. The course is intended to students from upper classes and to graduate students. Prerequisites: understanding of elementary concepts from computational complexity, probability theory and discrete math.
Last update: T_KTI (12.05.2006)
|
|
||
Naučit vybrané kapitoly z výpočetní složitosti Last update: T_KTI (23.05.2008)
|
|
||
The credit from tutorials is given based on the number of points obtained from the homework assignments. To get the credit one has to get at least 50% of the total number of points for the assignments, and one has to solve at least some problem from at least 3/4 of the assignments.
There are no make-up homeworks.
The credit from tutorials has to be obtained before taking an exam. Last update: Koucký Michal, prof. Mgr., Ph.D. (09.10.2017)
|
|
||
The exam is oral from the material covered by the lectures. Each student gets reasonable time (at most three hours) for preparation upon receiving the questions.
Study materials (lecture notes, text books, etc.), computers and other electronic devices are not allowed during the exam.
Last update: Koucký Michal, prof. Mgr., Ph.D. (09.10.2017)
|
|
||
For details for 2021/22 see: https://users.math.cas.cz/~talebanfard/mtc.html Last update: Koucký Michal, prof. Mgr., Ph.D. (01.10.2021)
|