Courses > PHD Courses
Top image

 
Home
News
Courses
Management Team
Conferences
Dutch OR Groups
People
Links
Contact
 

Landelijk Netwerk Mathematische Besliskunde

Course AC: Algorithms and Complexity 

Time: Monday 13.15 - 15.00 (September 09 - November 11).
Location: Hans Freudenthalgebouw, Room 611AB, Budapestlaan, Utrecht (De Uithof).
Lecturers: Dr. J. Nederlof (TU/e), Dr. M. Schmidt (EUR).

Course description:
Principles for construction of algorithms: Decomposition, greedy algorithms, dynamic programming. Algorithm analysis. Probabilistic algorithms. Approximation. Selected applications to sets, graphs, and geometry. Exponential time algorithms and Fixed Parameter Tractability.
Complexity Theory: Reductions. Complexity classes P (polynomial time), NP (non-deterministic polynomial time). NP-complete problems.

Literature:
Most material will be provided on the website. Additionally, for parts of the course it may be useful to buy the book
`Introduction to Algorithmsí, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein.

Prerequisites:
Knowledge of basic mathematics (set and logic notation, linear algebra, proof by induction, probability theory, big-O notation)

Examination:
Homework

Website for the course: Website AC

Address of the lecturer:
Dr. J. Nederlof
Dept. of Mathematics & Computer Science
Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven
Phone: 040 - 2478940 E-mail: j.nederlof@tue.nl URL: http://www.win.tue.nl/~jnederlo/


Dr. M. Schmidt
Rotterdam School of Management, Erasmus University Rotterdam
Burgemeester Oudlaan 50, 3062 PA Rotterdam
Phone: 010 4082199 E-mail: schmidt2@rsm.nl URL: https://www.rsm.nl/people/marie-schmidt/