Tom Altman
University of Colorado at Denver
Department:
Computer Science and Engineering
Phone:
(303) 315-1401
E-mail:
Tom.Altman@ucdenver.edu
Home
CSCI-5173/7173: Computational Complexity and Algorithms.
Syllabus
Reading Materials:
1.
Accidental Algorithms
2.
Black Hole Computers
3.
NP-Completeness: A Retrospective
4.
The Status of the P Versus NP Problem
5.
Algebrization: A New Barrier in Complexity Theory
6.
Algorithms and Complexity
7.
Relativizations of the P=NP Question
Sample Project Report:
1.
Report
2.
Presentation