SUNY Geneseo Department of Mathematics

Exercises and Such

Math 303
Fall 2015
Prof. Doug Baldwin

Last modified December 3, 2015

These are the assignment handouts and similar material from Math 303 (Theory of Computational Complexity). Send comments, questions, etc. related to these documents to Doug Baldwin.

  1. Problem Set 1—Algorithms
  2. Problem Set 2—Execution Time Analysis
  3. Problem Set 3—Recursive Algorithms
  4. Problem Set 4—Recurrence Relations
  5. Exam 1 Practice Problems
  6. Problem Set 5—Lower Bounds for Problems
  7. Problem Set 6—P and NP
  8. Optional Presentation
  9. Problem Set 7—NP Completeness