CSc I2600 Computational Complexity

Complexity measures for algorithmic systems, determinism vs. non-determinism, time vs. space, complexity hierarchies, aspects of the P-NP question, inherent complexity of specific algorithmic problems, recent applications to cryptography.

Credits

3

Prerequisite

CSC 30400 and CSc I2000 or CSc I0600.

Contact Hours

3 hr./wk.