Algoritmos e complexidade Notas de aula - Arquivo Escolar

Bibliografia
[42] Jon Kleinberg e Éva Tardos. Algorithm design. Addison-Wesley, 2005.
[43] Donald E. Knuth. The art of computer programming. 2nd. Vol. III, Sorting
and searching. Addison-Wesley, 1998.
[44] H. W. Kuhn. “The Hungarian Method for the assignment problem”.
Em: Naval Re4search Logistic Quarterly 2 (1955), pp. 83–97.
[45] Richard Ladner. “On the structure of polynomial time reducibility”.
Em: Journal of the ACM (1975). url: http://weblog.fortnow.com/
2005/09/favorite-theorems-np-incomplete-sets.html.
[46] Jan van Leeuwen, ed. Handbook of theoretical computer science. Vol. A:
Algorithms and complexity. MIT Press, 1990. url: http : / / www .
amazon.com/Handbook- Theoretical- Computer- Science- Vol/dp/
0262720140.
[47] Tom Leighton. Manuscript, MIT. 1996.
[48] Vladimir Iosifovich Levenshtein. “Binary codes capable of correcting
deletions, insertions, and reversals”. Em: Soviet Physics Doklady (1966),
pp. 707–710.
[49] Leonid Levin. “Universal’ny e pereborny e zadachi (Universal Search
Problems: in Russian)”. Em: Problemy Peredachi Informatsii 9.3 (1973),
pp. 265–266.
[50] Seth Lloyd. “Computational capacity of the universe”. Em: Physical
Review Letters 88.23 (2002). http://focus.aps.org/story/v9/st27.
[51] M.J. Magazine, G.L.Nemhauser e L.E.Trotter. “When the greedy solution
solves a class of Knapsack problems”. Em: Operations research 23.2
(1975), pp. 207–217.
[52] A. R. Meyer e L. J. Stockmeyer. “The equivalence problem for regular
expression with squaring requires exponential time”. Em: Proc. 12th
IEEE Symposium on Switching and Automata Theory. 1972, pp. 125–
129.
[53] B. Monien e E. Speckenmeyer. “Solving satisfiability in less than 2 n
steps.” Em: Discrete Appl. Math 10 (1985), pp. 287–295.
[54] J. Munkres. “Algorithms for the assignment and transporation problems”.
Em: J. Soc. Indust. Appl. Math 5.1 (1957), pp. 32–38.
[55] K. Noshita. “A theorem on the expected complexity of Dijkstra’s shortest
path algorithm”. Em: Journal of Algorithms 6 (1985), pp. 400–408.
[56] D. Pearson. “A polynomial time algorithm for the change-making problem”.
Em: Operations Research Letters 33.3 (2005), pp. 231–234.
330