FINAL EXAM

• WHEN and WHERE: Monday May 8 2:00 -- 5:00, in usual classroom
• FORMAT: similar in the midterm exam. Open book, with a section based on short questions (the "True/False/Unknown" type).
• WHAT IS COVERED: 1) Quantum Complexity: will appear only in the short question section. 2) Material based on Papadimitriou's textbook. The following tells you what sections are required, but my actual lectures will indicate the emphasis I place on the topics.
  1. Chapter 1: general intro
  2. Chapters 2, 3, 7, 8: be familiar with everything here as they are basic (but skip Fagin's theorem Section 8.3).
  3. Chapter 9: NP-completeness, only section 1,2,3.
  4. Chapter 10: NP and co-NP, all required.
  5. Chapter 11: Randomized algorithms, fairly basic chapter. Skip section 3 (random sources).
  6. Chapter 12: Cryptography, all sections required.
  7. Chapter 13: Approximability, all sections required.
  8. Chapter 17: Polynomial Hierarchy, all required.