Tuesday, November 13, 2012

Yes, it's true, I just can't get enough...

I've signed up for Algorithms: Design and Analysis, Part 2, and got this enthusiastic auto-response:

Thank you for signing up for Algorithms: Design and Analysis, Part 2! Part 2 of Algorithms: Design and Analysis will be action-packed with great topics: the greedy algorithm design paradigm, with applications to computing good network backbones and good codes for data compression; the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments; NP-completeness and the famous “P vs. NP” problem and what they mean for the algorithm designer; and strategies for dealing with hard (i.e., NP-complete) problems , including the design and analysis of heuristics. We're shooting for a launch date of December 2nd, 2012.

No comments:

Post a Comment