James A. Foster 

Analysis of Algorithms (Spring 1998)CS 495/Math 475Instructor: Dr. James A. Foster. I respond better to email than to any other communications venue. In this course, we will learn mathematical techniques for quantifying the inherent efficiency of algorithms in an implementation independent way. We will then discuss several ways to design better algorithms. In particular, we will look at divide and conquer strategies, dynamic programming, backtracking, branch and bound, probabilistic algorithms, and approximation algorithms. The focus of the course is on answering the questions: how good is my best algorithm for a given task, and what do I do if that isn't good enough?
Announcements
foster@cs.uidaho.edu Last modified: Tue Apr 28 10:20:48 1998 
Last Updated 01/13/2003 15:56 0800 