Units: 4 Terms Offered: FaSpSmFundamental techniques for design and analysis of algorithms. Dynamic programming; network flows; theory of NP-completeness; linear programming; approximation, randomized, and online algorithms; basic cryptography. Prerequisite:CSCI 570; Recommended Preparation: familiarity with algorithms and discrete mathematics. Registration Restriction: Open only to doctoral students. Instruction Mode: Lecture Grading Option: Letter
You must be logged in to post a comment.