CS-E4500 - Advanced Course in Algorithms, 08.01.2019-04.04.2019
This course space end date is set to 04.04.2019 Search Courses: CS-E4500
Topic outline
-
Weekly lecture slides and other materials will be published here.
Supporting reading material includes:
- J. von zur Gathen, J. Gerhard, Modern Computer Algebra, 3rd ed., Cambrige University Press, 2013.
- R. Brent, P. Zimmermann, Modern Computer Arithmetic, Cambridge University Press, 2011.
- S. S. Wagstaff, Jr., The Joy of Factoring, American Mathematical Society, 2013.
- R. Lidl, H. Niederreiter, Finite Fields, 2nd ed., Cambridge University Press, 1997.
- C. Van Loan, Computational Frameworks for the Fast Fourier Transform, SIAM, 1992.
- S. Gao, A new algorithm for decoding Reed-Solomon codes, Communications, Information and Network Security, The Springer International Series in Engineering and Computer Science, Vol. 712, Springer, 2003, pp. 55–68.
- M. L. Carmosino, J. Gao, R. Impagliazzo, I. Mihajlin, R. Paturi, S. Schneider, Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility, ITCS'16 Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ACM, 2016, pp. 261–270.
- R. R. Williams, Strong ETH breaks with Merlin and Arthur: short non-interactive proofs of batch evaluation, 31st Conference on Computational Complexity (CCC 2016), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Article No. 2, pp. 2:1–2:17. (arxiv)
- A. Björklund, P. Kaski, How proofs are prepared at Camelot, PODC'16 Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, ACM, 2016, pp. 391–400. (arxiv)
-
Lecture 1 File PDF
-
Lecture 2 File PDF
-
Lecture 3 File PDF
-
Lecture 4 File PDF
-
Lecture 5 File PDF
-
Lecture 6 File PDF
-
Lecture 7 File PDF
-
Lecture 8 File PDF
-
Lecture 9 File PDF