AUCBanner
catalog2

Main Page

Table of Contents


 

General Information

Undergraduate Studies

Graduate Studies

Research

Continuing Education & Training Programs

Appendix: Personnel & Enrollment

 

 

 

 

 

 

 

doctorate2 cafe2 study3
gradstud
 Computer Science Courses
SPNavLeft SPNavRight SPNavUp

CSCI

525

SPNavLeft SPNavRight SPNavUp

Algorithms and Complexity Theory

Measures of the complexity of algorithms. Amortized complexity. Greedy algorithms. Dynamic programming. NP-Completeness and lower-bound theory. Cook's Theorem. Techniques for proving problems NP-complete. Complexity of parallel algorithms. Well-parallelizable and hardly-parallelizable problems.

3 cr.

Copyright © 2003-2004, The American University in Cairo

[Home]
[Computer Science Courses]