Skip to content. | Skip to navigation

ARCHIVAL SITE · NO LONGER MAINTAINED
Please visit us at www.cs.luc.edu
Sections
Personal tools
You are here: Home Academic Programs and Information Courses COMP 460: Algorithms and Complexity

COMP 460: Algorithms and Complexity

Credit hours
3
Prerequisites
COMP 363
Instructor
Dr.Andrew Harrington
Description
The design and analysis of algorithms is central to computer science. This course will focus both on presenting general techniques for designing correct and efficient algorithms, as well as on formal methods for proving the correctness and analyzing the complexity of such algorithms. Also included will be an introduction to the theory of NP-completeness, whereby certain computation problems can be classified as being difficult in a formal sense.

Syllabus
Taught by Dr. Greenberg Fall 2004.
Document Actions
« November 2017 »
November
MoTuWeThFrSaSu
12345
6789101112
13141516171819
20212223242526
27282930