Introduction to resource-bounded computations, central complexity-theoretic concepts such as complexity classes, reducibility, completeness, and intractability.
Requisites
Prerequisites:
CS 3500 (Min. Grade: D)
Restrictions:
Cannot be enrolled in one of the following Levels: Undergraduate Semester (US)
Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * (A)
All Instructors
GPA: 3.40Most Common: A (46.2%)
This total includes data from semesters with unknown instructors