Textbook Information for CSE 417, Winter 2013

Required reading: Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006. (Available from the U Book Store, Amazon, etc.)

Supplementary reading: Based on past experience, we will probably have little if any time to cover the "computability" material outlined in the catalog description. If you want additional material on these topics, as well as an alternative presentation of the computational complexity/NP-completeness topics, we recommend: Michael Sipser, Introduction to the Theory of Computation, 3rd ed., Thompson Course Technology, 2005. (Available from Amazon, etc., and on reserve in the Engineering Library.) Earlier editions are OK, too.