Computational Complexity see also Complexity Theory Bridges, Douglas S. Computability. New York: Springer-Verlag, 1994. 178 p. $38.95. Brookshear, J. Glenn. Theory of Computation: Formal Languages, Automata, and Complexity. Redwood City, CA: Benjamin/Cummings, 1989. 322 p. $56.95. Cooper, S.B.; Slaman, T.A.; and Wainer, S.S. (Eds.). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. New York: Cambridge University Press, 1996. 354 p. $39.95. Davis, Martin. Computability and Unsolvability. New York: Dover, 1982. 248 p. $8.95. Du, Ding-Zhu and Ko, Ker-I. Theory of Computational Complexity. New York; Wiley, 2000. 491 p. $?. Garey, Michael R. and Johnson, David S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman, 1983. 340 p. $26.95. Hopcroft, John E. and Ullman, Jeffrey D. Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979. 418 p. $50.50. Lewis, Harry R. and Papadimitriou, Christos H. Elements of the Theory of Computation. Englewood Cliffs, NJ: Prentice-Hall, 1981. 466 p. $70.82. Sudkamp, Thomas A. Language and Machines: An Introduction to the Theory of Computer Science, 2nd ed. Reading, MA: Addison-Wesley, 1996. $43.50. Welsh, D. J. A. Complexity: Knots, Colourings and Counting. Cambridge, England: Cambridge University Press, 1993. 163 p. $38.95.