-----

Automata, Formal Languages, and Complexity

-----

Since God created computer science, the standard textbook in this area has been Hopcroft and Ullman. For elementary material, many people find Lewis and Papadimitriou more readable. For advanced material, consult the new book by Papadimitriou: it is more readable and more up to date than Hopcroft and Ullman.

If you understand the ideas involved in NP-completeness and need to track down a specific result, the book by Garey and Johnson is very useful.

-----

Handbook Main Page

Ownership, Maintenance, and Disclaimers

-----

Last modified Friday, 12-Sep-1997 14:59:07 PDT