
 [No title] (Site not responding. Last check: 20070918) 
  General overview of complexity classes P and NP, including upper, average, and lower bound analysis. 
  Complexity classes P, NP, PSpace; tractable and intractable problems, existence of methods for obtaining approximate solutions to intractable problems 
  Stu dents will gain an understanding of complexity classes, and a further appreciation for asymptotic measurements of complexity and the difference between average and worst case analysis. 
 cs.wwc.edu /KU/AL5.html (96 words) 
