CSE 4115 W 2007 - Additional References

 Garey,M.R. and Johnson, D.S., Computers and Intractibility, 
A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.


 Papadimitriou, C.H., Computational Complexity,
Addison Wesley, 1994.

 Greenlaw,R. and Hoover,H.J., Fundamentals of the Theory of Computation,
Principles and Practice, Morgan Kauffman, 1998.

 Cormen, T.H., Leiserson, C.E. and Rivest, R.L.,
Introduction to Algorithms, McGraw-Hill & MIT Press, 1991.

 Lewis, H.R. and Papadimitriou, C.H., 
Elements of the Theory of Computation (Second Edition), Prentice Hall, 1998.



 Hopcroft, J.E. and Ullman, J.D.,  Introduction
to Automata, Languages and  Programming, Addison Wesley, 1979.