====== 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 [[http://www.inf.ufrgs.br/ppgc/disciplinas/lista-de-disciplinas/cmp601/|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 =====

  * [[2016-2a-Notas|Resultados]] do primeiro exame de qualificação.
  * [[2016-2b-Notas|Resultados]] do segundo exame de qualificação.
  * [[2016-2c-Notas|Resultados]] da disciplina.


===== 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]].
  * {{:cmp155:notas-4227.pdf|Lecture notes}} (in Portuguese, updated 16/5/2012).
  * {{:cmp601:exq20162a.pdf|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 | [[wppt>Proclamação da indepedência]]                           |           |   |  {{q0120162.pdf|E1}}  |  {{s0120162.pdf|S1}}  |
|     | 12/09 | //[[http://semac.inf.ufrgs.br|Semana acadêmica]]//             |           |   |   |                       |
|     | 14/09 | //[[http://semac.inf.ufrgs.br|Semana acadêmica]]//             |           |   |   |                       |
|   9 | 19/09 | Greedy algorithms                                              |           |   |   |                       |
|  10 | 21/09 | Greedy algorithms                                              |           |   |   |                       |
|  11 | 26/09 | Greedy algorithms                                              |           |   |  {{q0220162.pdf|E2}}  |  {{s0220162.pdf|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                                             |           |   |  {{q0320162.pdf|E3}}  |  {{s0320162.pdf|S3}}  |
|     | 12/10 | [[wppt>Nossa senhora aparecida]]                               |           |   |   |                       | **Prazo lista E2**: 14/10 |
|  16 | 17/10 | Dynamic programming                                            |           |   |   |                       |
|  17 | 19/10 | Dynamic programming                                            |           |   |   |                       |
|  18 | 24/10 | Dynamic programming                                            |           |   |  {{q0420162.pdf|E4}}  |  {{s0420162.pdf|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 | [[wppt>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 [[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>