Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. O

"Spufford cunningly maps out a literary genre of his own . . . Freewheeling and fabulous." —The Times (London) Strange as it may seem, the gray, oppressive US

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspecti

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.