每日探花

COMP 506 Advanced Analysis of Algorithms (3 credits)

Offered by: Informatique (Facult茅 des sciences)

Vue d'ensemble

Informatique (Sci) : The study of computational complexity and intractability: Cook's Theorem, NP-completeness, oracles, the polynomial hierarchy, lower bounds, heuristics, approximation problems.

Terms: This course is not scheduled for the 2009-2010 academic year.

Instructors: There are no professors associated with this course for the 2010-2011 academic year.

  • 3 hours
  • Prerequisite: COMP 330 or COMP 360 or COMP 431.
Back to top