====== CMP 601: Algorithms and Theory of Computation (2019/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:** Tue/Thu 10.30, 112, building 43425.\\
**Consultation hours:** Wed 15.30, room 216.\\
**Details:** On the [[http://www.inf.ufrgs.br/ppgc/disciplinas/lista-de-disciplinas/cmp601|homepage of the course at PPGC]].

===== News =====

  * First exam: Aug 23, 2018. The exam will take 2.5 hours.

===== Results =====


===== Additional material =====

  * Homepage of CMP155 (Análise e Desenvolvimento de Algoritmos) in [[:cmp155:2011-1|2011/1]], [[:cmp155:2010-1|2010/1]], [[:cmp155:2008-1|2008/1]] and [[:cmp155:2007-1|2007/1]].
  * Homepage of CMP601 in [[:cmp601:2015-1|2015/1]], [[:cmp601:2016-2|2016/2]], and [[:cmp601:2018-1|2018/1]].
  * {{:cmp155:notas-10619.pdf|Lecture notes}} (in Portuguese, updated 19/9/2019).

==== Lectures ====

^ No.  ^ Data   ^ Topics                              ^ Chap. in\\ notes ^  Exercises  ^  Solutions 	 ^ Reading ^
|     |       | ** Algorithms **                       |    |                       |   |      |
|   1 | 13/08 | Administrativa. Introduction.          |  1 |                       |   |  1.1 |
|   2 | 15/08 | Representative problems.               |    |                       |   |  1.2 |
|   3 | 20/08 | Basics of algorithm analysis.          |  2 |                       |   |  2 |
|   4 | 22/08 | Graph algorithms 1                     |    |                       |   |  3.[12],4.4 |
|     | 23/08 | **Pre-semester exam.**                 |    |  {{exq20192a.pdf|E}}  |  {{exq20192as.pdf|S}}  |    |
|   5 | 27/08 | Graph algorithms 2.                    |    |                       |   |  3.[3-6] |
|   6 | 29/08 | Graph algorithms 3.                    |    |  {{q0120192.pdf|Q1}}  |  {{sq0120192.pdf|S1}}  |   |
|   7 | 03/09 | Greedy algorithms 1.                   |  4 |                       |   |  4.[12] |
|   8 | 05/09 | Greedy algorithms 2                    |  4 |                       |   |  4.5 |
|   9 | 10/09 | Greedy algorithms 3                    |  4 |  {{q0220192.pdf|Q2}}  |  {{sq0220192.pdf|S2}}  |  4.9 |
|  10 | 12/09 | Divide-and-conquer 1                   |  5 |                       |   |  5.[123] |
|  11 | 17/09 | Divide-and-conquer 2                   |  5 |                       |   |  5.[45] |
|  12 | 19/09 | Divide-and-conquer 3                   |  5 |  {{q0320192.pdf|Q3}}  |  {{sq0320192.pdf|S3}}  |  5.6 |
|  13 | 24/09 | Dynamic programming 1                  |  6 |                       |   |  6.[12] |
|  14 | 26/09 | Dynamic programming 2                  |  6 |                       |   |  6.[45] |
|     |       | ** Theory of computation **            |   |   |   |   |
|  15 | 01/10 | Theory: TBD                            |   |   |   |   |
|  16 | 03/10 | Theory: TBD                            |   |   |   |   |
|  17 | 08/10 | Dynamic programming 3                  |  6 |  {{q0420192.pdf|Q4}}  |  {{sq0420192.pdf|S4}}  |  6.[67] |
|  18 | 10/10 | Theory: TBD                            |   |   |   |   |
|     | 15/10 | //Semana acadêmica//                   |   |   |   |   |
|     | 17/10 | //Semana acadêmica//                   |   |   |   |   |
|  19 | 22/10 | Theory: TBD                            |   |   |   |   |
|  20 | 24/10 | Theory: TBD                            |   |   |   |   |
|  21 | 29/10 | Theory: TBD                            |   |   |   |   |
|  22 | 31/10 | Theory: TBD                            |   |   |   |   |
|  23 | 05/11 | Theory: TBD                            |   |   |   |   |
|  24 | 07/11 | Theory: TBD                            |   |   |   |   |
|  25 | 12/11 | Theory: TBD                            |   |   |   |   |
|  26 | 14/11 | Theory: TBD                            |   |   |   |   |
|  27 | 19/11 | Theory: TBD                            |   |   |   |   |
|  28 | 21/11 | Theory: TBD                            |   |   |   |   |
|  29 | 26/11 | Theory: TBD                            |   |   |   |   |
|  30 | 28/11 | Theory: TBD                            |   |   |   |   |
|     | 10/12 | Prova de recuperação.                  |   |   |   |   |
|     | 20/12 | **Post-semester exam.**                |   |  {{exq20192b.pdf|E}}  |  {{exq20192bs.pdf|SE}}  |   |
|     | 11/01 | Official end of lecture period 2019/2. |   |   |   |   |

==== Evaluation ====

See the [[http://www.inf.ufrgs.br/ppgc/disciplinas/lista-de-disciplinas/cmp601/|homepage of the course at PPGC]].

==== Bibliography ====

<html>
<!-- BEGIN BIBLIOGRAPHY Bibliografia -->
<!--
    DO NOT MODIFY THIS BIBLIOGRAPHY BY HAND!  IT IS MAINTAINED AUTOMATICALLY!
    YOUR CHANGES WILL BE LOST THE NEXT TIME IT IS UPDATED!
-->
<!-- Generated by: /home/ritt/arch/share/bin/bib2xhtml -s unsortlist Bibliografia.bib Bibliografia.html -->
<ul class="bib2xhtml">

<!-- Authors: Sanjeev Arora and Boaz Barak -->
<li><a name="Arora.Barak/2009">Sanjeev</a> Arora and Boaz Barak.
<cite>Computational Complexity: A Modern Approach</cite>.
Cambridge University Press, 2009.</li>

<!-- Authors: Thomas H Cormen and Charles E Leiserson and Ronald L Rivest and
  Clifford Stein -->
<li><a name="Cormen.etal/2001">Thomas</a>&nbsp;H. Cormen, Charles&nbsp;E.
  Leiserson, Ronald&nbsp;L. Rivest, and Clifford Stein.
<a href="http://projects.csail.mit.edu/clrs"><cite>Introduction to
  Algorithms.</cite></a>
The MIT Press, 2nd edition, 2001.</li>

<!-- Authors: Michael R Garey and David S Johnson -->
<li><a name="Garey.Johnson/1979">Michael</a>&nbsp;R. Garey and David&nbsp;S.
  Johnson.
<a href="http://en.wikipedia.org/wiki/Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness"><cite>Computers and intractability: A guide to
  the theory of NP-completeness</cite></a>.
Freeman, 1979.</li>

<!-- Authors: E Horowitz and S Sahni -->
<li><a name="Horowitz.Sahni/1984">E</a>.&nbsp;Horowitz and S.&nbsp;Sahni.
<cite>Fundamentals of Computer Algorithms</cite>.
Computer Science Press, 1984.</li>

<!-- Authors: Laira Vieira Toscani and Paula A S Veloso -->
<li><a name="Toscani.Veloso/2005">Laira</a>&nbsp;Vieira Toscani and
  Paula A.&nbsp;S. Veloso.
<a href="http://www.inf.ufrgs.br/~laira/"><cite>Complexidade de
  Algoritmos</cite></a>.
Editora Sagra Luzzatto, 2a edition, 2005.</li>

<!-- Authors: G Ausiello and P Crescenzi and G Gambosi and V Kann and A
  Marchetti Spaccamela and M Protasi -->
<li><a name="Ausiello.etal/1999">G</a>.&nbsp;Ausiello, P.&nbsp;Crescenzi,
  G.&nbsp;Gambosi, V.&nbsp;Kann, A.&nbsp;Marchetti-Spaccamela, and M.&nbsp;Protasi.
<a href="http://www.nada.kth.se/~viggo/approxbook"><cite>Complexity and
  approximation &ndash; Combinatorial Optimization Problems and their
  Approximability Properties</cite></a>.
Springer-Verlag, 1999.</li>

<!-- Authors: Bernhard H Korte and Jens Vygen -->
<li><a name="Korte/2005">Bernhard</a>&nbsp;H. Korte and Jens Vygen.
<a href="http://www.or.uni-bonn.de/~vygen/co.html"><cite>Combinatorial
  optimization theory and algorithms</cite></a>.
Springer, 4th edition, 2008.
INF 65.012.122 K85c.</li>

<!-- Authors: Christos H Papadimitriou and Kenneth Steiglitz -->
<li><a name="Papadimitriou.Steiglitz/1982">Christos</a>&nbsp;H.
  Papadimitriou and Kenneth Steiglitz.
<cite>Combinatorial optimization: Algorithms and complexity</cite>.
Prentice-Hall, dover edition, 1982.</li>

<!-- Authors: Juraj Hromkovivc -->
<li><a name="Hromkovic/2001">Juraj</a> Hromkovic.
<cite>Algorithmics for hard problems</cite>.
Springer, 2001.
INF 65.012.122 H873a.</li>

<!-- Authors: S Dasgupta and C Papadimitriou and U Vazirani -->
<li><a name="Dasgupta.etal/2009">S</a>.&nbsp;Dasgupta,
  C.&nbsp;Papadimitriou, and U.&nbsp;Vazirani.
<cite>Algoritmos</cite>.
McGraw-Hill, 2009.</li>

</ul>

<!-- END BIBLIOGRAPHY Bibliografia -->

</html>

<html>
<a href="http://www2.clustrmaps.com/counter/maps.php?url=http://www.inf.ufrgs.br/~mrpritt" id="clustrMapsLink"><img width=1 src="http://www2.clustrmaps.com/counter/index2.php?url=http://www.inf.ufrgs.br/~mrpritt" style="border:1px solid;" alt="Locations of visitors to this page" title="Locations of visitors to this page" id="clustrMapsImg" onError="this.onError=null; this.src='http://clustrmaps.com/images/clustrmaps-back-soon.jpg'; document.getElementById('clustrMapsLink').href='http://clustrmaps.com'" />
</a>
</html>