Índice
-
- INF 5010: Otimização combinatória
- INF 5016: Algoritmos avançados
- INF 5023: Técnicas de busca heurística.
Ferramentas de Utilizador
Barra Lateral
cmp601:2016-2
Tabela de Conteúdos
CMP 601: Algorithms and Theory of Computation (2016/2)
Somebody once asked John Hopcroft about the problem of P and NP. He answered: “On Tuesdays, I try to prove that they are equal, on the rest of the week - that they are different.” I believe that he has reduced the time to try to show that they are equal to Sunday afternoons.
General information
Professors: Álvaro Freitas Moreira, Marcus Ritt
Total hours: 60 h (in 30 lectures of 2h)
Credits: 4
Summary: Theory of Computation: Models of computation. Limitation of formal systems. Complexity theory.
Algorithms: Analysis of algorithms. Main techniques for designing algorithms.
Time and room: Seg/Qua 10.30, room 106(67).
Consultation hours: Seg 13.30, sala 201
Details: Ver a homepage of the course at PPGC.
News
- Introduction: Aug 3, 2016.
- First exam: Aug 8, 2016. The exam will take 2.5 hours.
- Second exam: Dec 7, 2016. The exam will take 2.5 hours.
Results
- Resultados do primeiro exame de qualificação.
- Resultados do segundo exame de qualificação.
- Resultados da disciplina.
Additional material
- Homepage of CMP601 in 2015/1.
- Lecture notes (in Portuguese, updated 16/5/2012).
- Some comments on the qualification exam.
Lectures
| No. | Data | Tópicos | Notas pág. | Exercícios | Soluções | Leitura | |
|---|---|---|---|---|---|---|---|
| Introduction & pre-semester exam | |||||||
| 01/08 | Administrativa. | ||||||
| 1 | 03/08 | Introduction. | |||||
| 08/08 | Pre-semester exam. | ||||||
| 10/08 | Evaluation of exam | ||||||
| Algorithms | |||||||
| 2 | 15/08 | Representative problems. | |||||
| 3 | 17/08 | Basics of algorithm analysis | |||||
| 4 | 22/08 | Theory: Introduction | |||||
| 5 | 24/08 | Theory: Introduction | |||||
| 6 | 29/08 | Graph algorithms | |||||
| 7 | 31/08 | Graph algorithms | |||||
| 8 | 05/09 | Graph algorithms | |||||
| 07/09 | Proclamação da indepedência | E1 | S1 | ||||
| 12/09 | Semana acadêmica | ||||||
| 14/09 | Semana acadêmica | ||||||
| 9 | 19/09 | Greedy algorithms | |||||
| 10 | 21/09 | Greedy algorithms | |||||
| 11 | 26/09 | Greedy algorithms | E2 | S2 | |||
| 12 | 28/09 | Theory: TBD | Prazo lista E1: 30/09 | ||||
| 13 | 03/10 | Divide-and-conquer | |||||
| 14 | 05/10 | Divide-and-conquer | |||||
| 15 | 10/10 | Divide-and-conquer | E3 | S3 | |||
| 12/10 | Nossa senhora aparecida | Prazo lista E2: 14/10 | |||||
| 16 | 17/10 | Dynamic programming | |||||
| 17 | 19/10 | Dynamic programming | |||||
| 18 | 24/10 | Dynamic programming | E4 | S4 | |||
| Theory of computation | Prazo lista E3: 28/10 | ||||||
| 19 | 26/10 | The Turing machine: motivation, importance | |||||
| 20 | 31/10 | Universal TMs, multi-tape TMs | |||||
| 02/11 | Finados | ||||||
| 21 | 07/10 | Primitive recursive functions | |||||
| 22 | 09/11 | Primitive recursive functions, exercises | Prazo lista E4: 11/11 | ||||
| 23 | 14/11 | Partial recursive functions | |||||
| 24 | 16/11 | Equivalence of TMs and partial recursive functions | |||||
| 25 | 21/11 | Equivalence of TMs and partial recursive functions | |||||
| 26 | 23/11 | The halting problem, reductions, Rice's theorem | |||||
| 27 | 28/11 | O-notation, introduction to complexity theory, nondeterminism | |||||
| 28 | 30/11 | The Church-Turing thesis | |||||
| 29 | 05/12 | Languages and problems, classes P and NP, NP-completeness | |||||
| 07/12 | Post-semester exam (a ser confirmado oficialmente ainda). | ||||||
| 30 | TBD | The Cook-Levin theorem and more NP-complete problems | |||||
| 12/12 | Prova de recuperação. | ||||||
| 21/12 | Official end of lecture period 2016/2. |
Evaluation
See the homepage of the course at PPGC.
Bibliography
- Sanjeev Arora and Boaz Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2009.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.
- Michael R. Garey and David S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. Freeman, 1979.
- E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1984.
- Laira Vieira Toscani and Paula A. S. Veloso. Complexidade de Algoritmos. Editora Sagra Luzzatto, 2a edition, 2005.
- G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and approximation – Combinatorial Optimization Problems and their Approximability Properties. Springer-Verlag, 1999.
- Bernhard H. Korte and Jens Vygen. Combinatorial optimization theory and algorithms. Springer, 4th edition, 2008. INF 65.012.122 K85c.
- Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial optimization: Algorithms and complexity. Prentice-Hall, dover edition, 1982.
- Juraj Hromkovic. Algorithmics for hard problems. Springer, 2001. INF 65.012.122 H873a.
- S. Dasgupta, C. Papadimitriou, and U. Vazirani. Algoritmos. McGraw-Hill, 2009.
cmp601/2016-2.txt · Esta página foi modificada pela última vez em: 2017/02/13 11:56 por marcus
Ferramentas de Página
Excepto menção em contrário, o conteúdo neste wiki está sob a seguinte licença: CC Attribution-Noncommercial-Share Alike 4.0 International
