[Todos] Mini-curso en el Instituto de Cálculo

[gduran en dm.uba.ar]

Mini-curso de grado y posgrardo

"INTRODUCTION TO EFFICIENT ALGORITHMS: BASIC TECHNIQUES AND INTRACTABILITY"
A cargo de: Dr. Fabiano Oliveira (UERJ, Brasil)
Profesor visitante Instituto de Cálculo
Del lunes 20/10 al viernes 24/10, de 10 a 13.
Lugar: Instituto de Cálculo
Interesados presentarse el lunes 20/10 a las 10 en el IC.


Goals:
●	Introduction to Computer Science/Engineering/Math graduate and
undergraduate students the practice of algorithm analysis, covering the
basic techniques of efficient algorithm development.
●	Introduction to NP-completeness theory

Pre-requisite:
Programming logic (some knowledge of any real programming language is
desirable)

Outline:
Lecture 1 - Complexity analysis of algorithms
Lecture 2 - Recursion
Lecture 3 - Dynamic Programming
Lecture 4 - Greedy algorithms
Lecture 5 - Intractability theory (definition of P and NP complexity classes)

The course will be delivered in Portuguese.

Assessment:
In order to assess students, they will be asked for coding in some popular
computer language to solve about 6 problems, each one requiring one of the
three techniques being presented: a recursion, a dynamic programming, or a
greedy algorithm. Students will have 4 to 8 weeks to deliver their work
for grading.

Bibliography:
Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E.
Leiserson. 2001. Introduction to Algorithms (2nd ed.). McGraw-Hill Higher
Education.



Saludos a todos

Guillermo Durán