Algoritmos e complexidade Notas de aula - Arquivo Escolar

Bibliografia
[57] Salvador Roura. “Improved Master Theorems for Divide-and-Conquer
Recurrences”. Em: Journal of the ACM 48.2 (2001), pp. 170–205.
[58] J.R. Sack e J. Urrutia, eds. Handbook of computational geometry. Elsevier,
2000.
[59] A. Schönhage e V. Strassen. “Schnelle Multiplikation grosser Zahlen”.
Em: Computing 7 (1971), pp. 281–292.
[60] Alexander Schrijver. Combinatorial optimization. Polyhedra and efficiency.
Vol. A. Springer, 2003.
[61] Michael Sipser. Introduction to the theory of computation. Thomson,
2006.
[62] Michael Sipser. “The history and status of the P versus NP question”.
Em: Proceedings of the 24th Annual ACM Symposium on the Theory of
Computing. 1992, pp. 603–619.
[63] Volker Strassen. “Guassian Elimination is not Optimal”. Em: Numer.
Math 13 (1969), pp. 354–356.
[64] Laira Vieira Toscani e Paula A. S. Veloso. Complexidade de Algoritmos.
2a. Editora Sagra Luzzatto, 2005. url: http://www.inf.ufrgs.br/
~laira/.
[65] Luca Trevisan. P and NP. http://lucatrevisan.wordpress.com/
2010/04/24/cs254-lecture-2-p-and-np. 2010.
[66] Alan Mathison Turing. “On computable numbers with an application to
the Entscheidungsproblem”. Em: Proc. London Math ˙ Soc. 2.42 (1936),
pp. 230–265.
[67] Vijay V. Vazirani. Approximation algorithms. Springer, 2001.
[68] Paul M. B. Vitányi e Lambert Meertens. “Big Omega Versus the Wild
Functions”. Em: SIGACT News 16.4 (1985).
[69] J.S. Vitter e Philipe Flajolet. “Handbook of theoretical computer science”.
Em: ed. por Jan van Leeuwen. Vol. A: Algorithms and complexity.
MIT Press, 1990. Cap. Average-case analysis of algorithms and data
structures. url: http://www.amazon.com/Handbook-Theoretical-
Computer-Science-Vol/dp/0262720140.
[70] Jie Wang. “Advances in Algorithms, Languages, and Complexity - In
Honor of Ronald V. Book”. Em: Kluwer, 1997. Cap. Average-Case Intractable
NP Problems.
[71] Wilkinson Microwave Anisotropy Probe. Online. 2010. url: http://
map.gsfc.nasa.gov (acedido em 13/03/2011).
331